Classical Primality Proofs: Pocklington and Lehmer

Executive summary

A factored part of n − 1 large enough to force primality

If a prime power q^e divides n − 1 and a suitable base exists, then every prime factor of n is congruent to 1 modulo q^e. Accumulating enough such constraints — a factored part exceeding √n — forces n to be prime. The base and the factorisation together form a short certificate that anyone can verify with a few modular exponentiations.

Learning objectives

State the Pocklington criterion and the size condition on the factored part.
Construct and verify an n − 1 certificate.
Apply the dual n + 1 test using Lucas sequences.
Recognise the numbers of special form where these tests excel.
Explain why the method fails for general large numbers.

Section 01The Pocklington criterion

Suppose q^e divides n − 1 and there is a with

aⁿ⁻¹ ≡ 1 (mod n) and gcd(a^(n−1)/q − 1, n) = 1

Then every prime factor of n is congruent to 1 modulo q^e. Collecting such conditions for enough prime powers gives a divisor F of n − 1 such that every prime factor of n is 1 modulo F; if F > √n, then n has no prime factor below its own square root and is therefore prime.

AlgorithmPocklington–Lehmer primality proofin: n, partial factorisation of n−1 → out: a primality proof

Factor n − 1 as far as feasible: n − 1 = F · U with F fully factored and gcd(F, U) = 1.
Require F > √n. If the factored part is too small, the method does not apply.
For each prime q dividing F, find a base a_q satisfying both conditions above.
Verify a_qⁿ⁻¹ ≡ 1 (mod n) for each.
Conclude n is prime. The certificate is the list of (q, a_q) together with primality certificates for each q, applied recursively.

Recursion terminates

Each q is smaller than n, so proving its primality is a strictly smaller problem. The recursion bottoms out at small primes verifiable by trial division, giving a finite tree that constitutes the whole certificate.

Section 02The n + 1 test

The dual test uses Lucas sequences in place of powers. Where the n − 1 test works in the multiplicative group of F_n, the n + 1 test works in the norm-one subgroup of the quadratic extension, whose order is n + 1 when n is prime and the discriminant is a non-residue.

The two classical tests compared
	n − 1 test	n + 1 test
Group used	F_n^×, order n − 1	Norm-one subgroup of F_n², order n + 1
Arithmetic	Modular exponentiation	Lucas sequences
Requires	Factored part of n − 1 exceeding √n	Factored part of n + 1 exceeding √n
Special case	Proth numbers k·2^m + 1	Mersenne and Lucas–Lehmer numbers

Combining the two

When neither n − 1 nor n + 1 has a large enough factored part alone, the two can be combined: factored parts F₋ and F₊ jointly constrain the possible prime factors, and a product exceeding roughly n^1/3 can suffice with additional conditions.

Section 03Where these tests excel and where they fail

Ideal

Proth numbers

For n = k·2^m + 1 with k small, n − 1 is completely factored by construction. Proth's theorem gives a single-base test — the basis of much large-prime searching.

Ideal

Mersenne numbers

For n = 2^p − 1, the Lucas–Lehmer test is a specialised n + 1 test requiring exactly p − 2 squarings.

Ideal

Factorial and primorial primes

n ± 1 is highly composite by construction, giving a large factored part for free.

Fails

General large n

Factoring n − 1 is as hard as factoring anything else of that size, so for a random large n the required factored part is unobtainable.

Fails

Cryptographic primes

Deliberately chosen so that n − 1 has a large prime factor, which is exactly the case where partial factorisation does not help.

Remedy

Elliptic curve proving

ECPP removes the dependence on factoring n ± 1 by replacing the fixed group with a curve group whose order can be resampled.

ReferenceFrequently asked questions

Why does the factored part need to exceed the square root?

Because the conditions force every prime factor of n to be at least F + 1. If F exceeds √n then n cannot have two such factors, and since it has at least one, it is prime.

How is a certificate verified?

By repeating the modular exponentiations and GCD checks — a handful of operations per prime — and recursively verifying the certificates of the auxiliary primes. Verification is orders of magnitude cheaper than the original search.

What is Proth's theorem?

For n = k·2^m + 1 with k odd and k less than 2^m, n is prime if and only if there is a base a with a^((n-1)/2) congruent to −1 modulo n. It is the n − 1 test specialised to a form where the factorisation is known in advance, and it makes testing a single exponentiation.

NavigateContinue in this stream

Curated next steps from this page. The site also surfaces algorithmically related reading below.

ProvenanceSources and further reading

This page is an original KEVOS explanatory article. It presents the underlying mathematics — definitions, algorithms, complexity results and selection criteria — in KEVOS editorial voice. No text is reproduced from any copyrighted source. Where numerical tables are relevant, KEVOS links to live authoritative databases rather than republishing static values.

Handbook application: from concept to controlled practice

Purpose. This expanded section turns the original page into a practical handbook. It preserves the supplied material and adds a repeatable way to apply, check and review Classical Primality Proofs: Pocklington and Lehmer. It does not replace a contract, legislation, a controlled standard, competent engineering judgement or specialist advice.

The operating aim is to turn a compact mathematical statement into a usable chain of definitions, claims, examples and checks. Read the original explanation first, then use the workflow and checks below to convert knowledge into evidence.

Treat Classical Primality Proofs: Pocklington and Lehmer as a network of definitions and implications, not as a list of formulas. The working vocabulary on this page—test, primality, pocklington, section, lehmer—should be made explicit before any proof or computation begins. Record the ambient set or structure, the permitted operations and the equality or equivalence relation in use. A compact theorem often changes meaning when the base field, finiteness condition, commutativity assumption or direction of an action changes.

For a proof, write the hypotheses as a checklist and mark the line at which each one is used. For a computation, state the representation of the input, the arithmetic model, the termination condition and the output invariant. For a classification problem, distinguish existence from uniqueness and distinguish an object from its representation. These separations prevent a correct local calculation from being mistaken for the general result.

A useful worked example should be small enough to inspect completely but rich enough to exercise the main mechanism. Compute the result in two ways where practical: symbolically and by substitution, structurally and numerically, or directly and through a normal form. Then include one near-miss example in which a hypothesis fails. The contrast explains why the theorem is shaped as it is and gives the reader a diagnostic pattern for later problems.

Verification is part of the mathematics. Check domains and codomains, substitute proposed solutions, test identity and zero cases, compare dimensions or cardinalities, and confirm that maps respect the required operations. In numerical work, report precision, conditioning and a residual rather than digits alone. In algorithmic work, separate mathematical correctness from implementation complexity and resource limits.

Step-by-step operating method

Fix the setting. State the objects, ambient structure, notation and assumptions before manipulating symbols.
Separate claims. Distinguish definitions, hypotheses, conclusions, equivalent conditions and consequences.
Choose a method. Select proof, construction, calculation or algorithm according to the question actually asked.
Work a small case. Use the smallest non-trivial example to expose the mechanism and test edge behaviour.
Verify independently. Substitute back, check invariants, test boundary cases or use an alternative derivation.

Worked-example protocol

Illustrative method—not a source theorem. Start with a small admissible input and list the definitions it must satisfy. Carry out each transformation on a separate line, citing the property that permits it. Preserve exact values until approximation is necessary. At the end, verify the output against the original definition and one invariant such as dimension, degree, determinant, order, norm or residual. Then alter one hypothesis and observe which step ceases to be valid. This protocol creates a reusable example without inventing a theorem-specific numerical answer.

Stage	Record	Quality check
Input	Objects, domain, notation, assumptions	Every symbol is defined
Method	Permitted operation or cited result at each step	All hypotheses hold
Output	Exact result and representation	Correct type, domain and form
Verification	Substitution, invariant or alternative derivation	Independent agreement
Boundary test	Zero, identity, degenerate or failed hypothesis	Scope is understood

Common failure modes and recovery actions

1. Watch for

Using a theorem without checking every hypothesis.

Recovery: Return to the governing definition or requirement and restate the decision in one sentence.

2. Watch for

Treating a suggestive example as a proof of the general case.

Recovery: Separate evidence from assumption, assign an owner and set a date for validation.

3. Watch for

Changing notation or conventions part-way through an argument.

Recovery: Run a small counterexample, boundary test, pilot or independent check before proceeding.

4. Watch for

Hiding a division-by-zero, convergence, finiteness or commutativity assumption.

Recovery: Record the consequence, decision and rationale, then update the controlled baseline.

5. Watch for

Reporting a computed result without a residual, substitution or structural check.

Recovery: Escalate when the issue affects safety, compliance, acceptance, material value or an agreed tolerance.

Review checklist

Can every symbol be traced to a definition or prior result?
Which hypothesis does each major step use?
Does the method cover zero, identity, degenerate and boundary cases?
Can the conclusion be checked by a second representation or calculation?
Are mandatory requirements distinguished from recommendations and illustrative values?
Are sources, assumptions, units, dates and versions recorded closely enough to reproduce the decision?
Have safety, legal, ethical, stakeholder and operational consequences been considered at the appropriate level?
Is there a named owner and a trigger for review, escalation, change or retirement?

Questions for deeper application

What is the most important distinction a practitioner must preserve when applying Classical Primality Proofs: Pocklington and Lehmer?