Least primitive root of prime numbers Least prime primitive root of prime numbers Least base necessary to prove the primality of a number Introduction Results References Links Contact Introduction Let p be a prime number. Fermat's little theorem states that a^(p-1) mod p=1 (a hat (^) denotes exponentiation) for all integers a between 1 and p-1. A primitive root of p is a number r such that any ...