Let \(p\) be a prime number and \(n\) be a positive integer. Prove that \(\phi(p^n-1)\) is divisible by \(n\), where \(\phi\) denotes Euler's totient function.

No vote yet

1 vote

×

Problem Loading...

Note Loading...

Set Loading...

## Comments

Sort by:

TopNewestFirstly,

\(p^n\equiv1\mod(p^n-1)\) Note that n is the smallest number with that property, in other words n\(=ord_{p^n-1}(p)\)

Also,

\(p^{\varphi(p^n-1)}\equiv1\mod(p^n-1)\)

But the order must divide every number with that property , so

\(n|\varphi(p^n-1)\) – Bogdan Simeonov · 2 years, 5 months ago

Log in to reply

– Finn Hulse · 2 years, 5 months ago

Beautiful. :DLog in to reply