Number Theory
Euler's Theorem
Generalization of Fermat: if gcd(a,n) = 1, then a^φ(n) ≡ 1 (mod n), where φ is Euler's totient function; central to RSA and large-exponent reductions.
0
Contest appearances
100
Practice problems
1–10
Difficulty levels
Drill this topic
Sign in and tell the coach to drill this knowledge point — it picks questions matched to your current level.