Groups
Category
Level
Miller–Rabin is a fast primality test that uses modular exponentiation to detect compositeness with very high reliability.
Fermat's Little Theorem says that for a prime p and integer a not divisible by p, a^{p-1} ≡ 1 (mod p).