[solved] – Question 69320

# Given an integer n, return the number of digits of n.
def digitCount(n):
return 42

# Given an integer n, return the sum of its digits.
def digitSum(n):
return 42

# Definition: For a positive integer n, n factorial, denoted n!,
# is the product n*(n-1)*(n-2)*…*1. If n = 0, then define 0! as 1.
# Given an integer n (which you can assume is non-negative),
# return n! (n factorial).
def factorial(n):
return 42

# Definition: We say that m is a factor of n if m divides n without a remainder.
# Given an integer n (which you can assume is positive),
# return the smallest factor of n larger than 1.
# If n is 1, then you should return 1.
def smallestFactor(n):
return 42

Expert Answer

---