Euler's theorem
= Euler's theorem
{c}
{wiki}
= Fermat-Euler theorem
{c}
{synonym}
If $\gcd(a,n)=1$, then $a^{\phi(n)}\equiv1\pmod n$. For prime $n=p$, this yields Fermat's little theorem.
= Euler's theorem
{c}
{wiki}
= Fermat-Euler theorem
{c}
{synonym}
If $\gcd(a,n)=1$, then $a^{\phi(n)}\equiv1\pmod n$. For prime $n=p$, this yields Fermat's little theorem.