Number Theory
Fermat's Little Theorem
If p is prime and gcd(a,p) = 1, then a^(p−1) ≡ 1 (mod p); used for exponent reduction and primality testing.
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.