Reply
Wed 30 Nov, 2005 09:11 pm
Hi all!
Let phi(n) be the Euler's phi function.
Show that if the equation phi(n) = k, where k is a positive integer, has exactly one solution n, then 36 divides n.
Any help will be greatly appreciated! Thanks!
every integral solution of the totient function for any non-zero integer has a unique solution doesn't it?
Rap
Another way of stating the problem is:
If phi(n) = k
and
for all m != n, phi(m) != k
then 36 divides n.
Stumble It!
Tweet This
Bookmark on Delicious
Share on Facebook
Share on MySpace