Euler theorem
= Euler theorem
{c}
{wiki}
If a is coprime to n, then a raised to the power phi(n) is congruent to one modulo n.
Multiplication by a unit $a$ permutes the reduced residue classes modulo $n$. Multiplying all classes before and after this permutation and cancelling their unit product proves $a^{\phi(n)}\equiv1\pmod n$.