# Primality test

• Wilson's theorem (inefficient): $(p-1)!$ evaluates to -1 mod p where p is the candidate prime number