Processing math: 100%

Euler's Theorem

If n is a positive integer and a is an integer coprime to n, then aϕ(n)1(modn) where ϕ is the Euler totient function.

Next Page