check a few primes
d(3^2) = 3. 1,3,9
d(5^4) = 5. 1,5,25,125,625
I expect it will not be hard to prove that d(p^(p-1)) = p
So now we're down to d(p) where p is prime...
Let d(n) equal the number of positive divisors of the integer n.
Find d(d(p^{p-1})) where p is any prime number.
1 answer