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

Euler's theorem

#Euler theorem#totient#modular exponentiation

Statement

State Euler's theorem and compute 32024(mod10)3^{2024}\pmod{10}.

Hint

For gcd⁡(a,n)=1\gcd(a,n)=1: aφ(n)≡1(modn)a^{\varphi(n)}\equiv1\pmod n. Here φ(10)=4\varphi(10)=4.

Show solutionHide solution

Solution

Theorem. If gcd⁡(a,n)=1\gcd(a,n)=1, then aφ(n)≡1(modn)a^{\varphi(n)}\equiv1\pmod n.

Parameters. n=10n=10, φ(10)=4\varphi(10)=4, a=3a=3 coprime to 1010.

Compute. 2024=4⋅5062024=4\cdot506, so 32024=(34)506≡1506=1(mod10)3^{2024}=(3^4)^{506}\equiv1^{506}=1\pmod{10}.

Conclusion. 32024≡1(mod10)3^{2024}\equiv1\pmod{10}.

Check. 34=81≡1(mod10)3^4=81\equiv1\pmod{10}. Correct.