Euler’s theorm Euler’s theorm Back If a and n are coprime then a^phi(n) ≡ 1 (mod n) this is the basis for RSA cryptography See Also Euler’s totient function