Thread: Combinatorial Study of Phi(n)
View Single Post
  #1  
Old October 29th, 2009, 09:57 AM
kyldn6 kyldn6 is offline
Newbie
  
Join Date: Oct 2009
Posts: 12
Country:
Thanks: 9
Thanked 0 Times in 0 Posts
kyldn6 is on a distinguished road
Default Combinatorial Study of Phi(n)
Prove that \phi(m) is even if m > 2.

and

Find all integers n such that \phi(n) = 12.

For the second one is it possible to do it simply with inspection or is there a formula I'm just missing?
Reply With Quote