Euler's Totient Theorem
Given: (1) gcd(m, n) = 1 m and n are relatively prime Then: m^ϕ(n) ≡ 1 (mod n)