def smallPhi(n):
phi = 1
factors = smallFactorGen(n)
for factor in factors:
p,k = factor
phi *= p**(k-1) * (p-1)
return phi
def d(n):
import primes
if n <= 1:
return 0
factors = primes.smallFactorGen(n)
ans = 1
for _,x in factors:
ans *= x+1
return ans
