Maths WorkshopMaths problems with full solutions
Exercise 855Number theory › CongruencesL1Added 3 Nov 2026

The order of an element mod $n$

#order#multiplicative group#divisor

Statement

Let aa be coprime to nn. Define ord⁡n(a)\operatorname{ord}_n(a) as the smallest positive kk with ak≡1(modn)a^k\equiv1\pmod n. Show that ord⁡n(a)∣φ(n)\operatorname{ord}_n(a)\mid\varphi(n).

Hint

Use Euler's theorem and division.

Show solutionHide solution

Solution

Euler. aφ(n)≡1(modn)a^{\varphi(n)}\equiv1\pmod n.

Division. Write φ(n)=qk+r\varphi(n)=qk+r with k=ord⁡n(a)k=\operatorname{ord}_n(a) and 0≤r<k0\le r<k. Then 1≡aφ(n)=aqk+r≡ar(modn)1\equiv a^{\varphi(n)}=a^{qk+r}\equiv a^r\pmod n. By minimality of kk, r=0r=0.

Conclusion. k∣φ(n)k\mid\varphi(n).