The Fermat primality test is a primality test, giving a way to test if a number is a prime number, using Fermat's little theorem and modular exponentiation (see modular arithmetic).

Fermat's Little Theorem states that if a is relatively prime to a prime number p, then \(a^{p-1} \equiv 1 \bmod p\)