Pocklington n − 1 primality test

In mathematics, the Pocklington n−1 primality test (or Pocklington–Lehmer primality test) is a primality test devised by Henry Cabourn Pocklington and Derrick Henry Lehmer. The test uses a partial factorization of ${\displaystyle N-1}$ to prove that an integer ${\displaystyle N}$ is prime.

It produces a primality certificate to be found with less effort than the Lucas primality test, which requires the full factorization of ${\displaystyle N-1}$.