Ask your own question, for FREE!
Mathematics 10 Online
OpenStudy (hitaro9):

Mobius Inversion Formula?

OpenStudy (hitaro9):

Use the fact that the sum (d|n) ph (n) = n and the mobius inversion to show that

OpenStudy (hitaro9):

phi(p^m) = p^m-p^m-1 where p is an odd prime

OpenStudy (hitaro9):

|dw:1427703979386:dw|

OpenStudy (hitaro9):

Where phi is the euler phi-function

OpenStudy (hitaro9):

I've seen proofs online, but none use the mobius inversion formula

OpenStudy (hitaro9):

|dw:1427704167263:dw|

Can't find your answer? Make a FREE account and ask your own questions, OR help others and earn volunteer hours!

Join our real-time social learning platform and learn together with your friends!
Can't find your answer? Make a FREE account and ask your own questions, OR help others and earn volunteer hours!

Join our real-time social learning platform and learn together with your friends!