Add remain code and complete. number is a number whose sum total of the factorials of each digit is equal to the number itself. The following are some examples of Krishnamurthy numbers: "145" is a Krishnamurthy Number because, 1! + 4! + 5! = 1 + 24 + 120 = 145 "40585" is also a Krishnamurthy Number. 4! + 0! + 5! + 8! + 5! = 40585 "357" or "25965" is NOT a Krishnamurthy Number 3! + 5! + 7! = 6 + 120 + 5040 != 357 The following function will check if a number is a Krishnamurthy Number or not and return a boolean value. """ def find_factorial(n): """ Calculates the factorial of a given number n """ fact = 1 while n != 0: fact *= n n -= 1 return fact def krishnamurthy_number(n): if n == 0: return False sum_of_digits = 0 # will hold sum of FACTORIAL of digits temp = n.
Add remain code and complete.
number is a number whose sum total of the factorials of each digit is equal to the
number itself.
The following are some examples of Krishnamurthy numbers:
"145" is a Krishnamurthy Number because,
1! + 4! + 5! = 1 + 24 + 120 = 145
"40585" is also a Krishnamurthy Number.
4! + 0! + 5! + 8! + 5! = 40585
"357" or "25965" is NOT a Krishnamurthy Number
3! + 5! + 7! = 6 + 120 + 5040 != 357
The following function will check if a number is a Krishnamurthy Number or not and return a
boolean value.
"""
def find_factorial(n):
""" Calculates the factorial of a given number n """
fact = 1
while n != 0:
fact *= n
n -= 1
return fact
def krishnamurthy_number(n):
if n == 0:
return False
sum_of_digits = 0 # will hold sum of FACTORIAL of digits
temp = n.
Step by step
Solved in 4 steps with 1 images
