 Several theorems about primes can be formulated using modular arithmetic.For instance, Fermat's little theorem states that if
formula_140 (mod formula_20), then formula_142 (mod formula_20).Summing this over all choices of formula_34 gives the equation
valid whenever formula_20 is prime.