Waste less time on Facebook — follow Brilliant.

Divisibility of Euler's Totient Function

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.

Note by Finn Hulse
3 years ago

No vote yet
1 vote


Sort by:

Top Newest


\(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)\)



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

\(n|\varphi(p^n-1)\) Bogdan Simeonov · 3 years ago

Log in to reply

@Bogdan Simeonov Beautiful. :D Finn Hulse · 3 years ago

Log in to reply


Problem Loading...

Note Loading...

Set Loading...