Processing math: 60%

Euler's Theorem

If n is a positive integer and a is an integer coprime to n, then a^{\phi(n)} \equiv 1 \pmod{n} where \phi is the Euler totient function.

Next Page