Toolkit 52

Euler's Theorem

Let nn be a positive integer. If gcd(n,a)=1\gcd(n,a)=1,

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