ExplainDev

>>> def factorial(n):

if n == 0 or n == 1:

return 1

else:

return n * factorial(n)

>>> factorial(5)

Traceback (most recent call last):

File "<pyshell#6>", line 1, in <module>

factorial(5)

File "<pyshell#5>", line 5, in factorial

return n * factorial(n)

File "<pyshell#5>", line 5, in factorial

return n * factorial(n)

File "<pyshell#5>", line 5, in factorial

return n * factorial(n)

[Previous line repeated 1021 more times]

File "<pyshell#5>", line 2, in factorial

if n == 0 or n == 1:

RecursionError: maximum recursion depth exceeded in comparison

num = 1634

# Changed num variable to string, 

# and calculated the length (number of digits)

order = len(str(num))

# initialize sum

sum = 0

# find the sum of the cube of each digit

temp = num

while temp > 0:

  digit = temp % 10

  sum += digit ** order

  temp //= 10

# display the result

if num == sum:

  print(num,"is an Armstrong number")

else:

  print(num,"is not an Armstrong number")

# Solve the quadratic equation ax**2 + bx + c = 0

# import complex math module

import cmath

a = 1

b = 5

c = 6

# calculate the discriminant

d = (b**2) - (4*a*c)

# find two solutions

sol1 = (-b-cmath.sqrt(d))/(2*a)

sol2 = (-b+cmath.sqrt(d))/(2*a)

print('The solution are {0} and {1}'.format(sol1,sol2))