Gilbreath's conjecture states that for all in the following array of differences (Guy 1994). Let
the difference of successive primes
be defined by ,
and
by
(1)
N. L. Gilbreath claimed that for all (Guy 1994). Kilgrove and Ralston (1959) verified the claim
for .
Odlyzko (1993) verified it for the initial segment containing all primes
below .
Colonna (2026) reports extending this computational verification through , completed on March 18, 2026.
Gilbreath's conjecture is equivalent to the statement that, in the triangular array of the primes, iteratively taking the absolute
difference of each pair of terms
(2)
(OEIS A036262), always gives leading term 1
(after the first row).
The number of terms before reaching the first greater than two in the second, third,
etc., rows are given by 3, 8, 14, 14, 25, 24, 23, 22, 25, ... (OEIS A000232).