Fermat's primality test
If we want to test if n is prime, then we can pick random a'''s in the interval and see if the equation above holds.  If the equality does not hold for a value of a, then n is composite (not prime).  If the equality does hold for many values of a, then we can say that n is probably prime, or a pseudoprime.