Euler's Theorem

Euler's Theorem:

Euler's Theorem states that if gcd(a,n) = 1, then a, the a^φ(n) (mod n)=1.

Here φ(n) is Euler's totient function: the number of integers in {1, 2, . . ., n-1} which are relatively prime to n.

Next: In the next section, we will learn Primitive roots.

Reference: Wikipedia, UTM