Fermat's Little Theorem

Fermat's Little Theorem

For every two integers $n,a$ we have $a^{\phi (n)}\equiv 1(\mathrm{mod}n).$ In particular if $n=p$ is a prime number then $a^p\equiv a(\mathrm{mod}p)$. (Here $\phi$ is euler function.)