SG
← Back

Euler's Theorem

a^{φ(n)} ≡ 1 (mod n) when gcd(a,n)=1.

mathnumber-theorymodularUpdated 2025-09-01

Generalization

  • Extends Fermat to composite n

Use

  • Mod exponent reduction