python函数求因子_因子个数使用Python递归函数(Factors of a number using Python recursive function)...

Your recursion is passing down x-1 which will not give you the right value. For example: the number of factors in 6 cannot be obtained from the number of factors in 5.

I’m assuming that you are not looking for the number of prime factors but only the factors that correspond to the multiplication of two numbers.

This would not normally require recursion so you can decide on any F(n) = F(n-1) pattern. For example, you could use the current factor as a starting point for finding the next one:

def NumFactors(N,F=1):

count = 1 if N%F == 0 else 0

if F == N : return count

return count + NumFactors(N,F+1)

You could also optimize this to count two factors at a time up to the square root of N and greatly reduce the number of recursions:

def NumFactors(N,F=1):

count = 1 if N%F == 0 else 0

if N != F : count = count * 2

if F*F >= N : return count

return count + NumFactors(N,F+1)