Fermat’s little theorem

Description:

• If $p$ is a prime and $gcd(a,p)=1$, then $a^{p-1}\equiv 1(modp)$.
• if $p$ is a prime, then for all $a,a^p\equiv a(modp)$