The Almost-Prime Bridge

Between n² and (n+1)², there should be a prime number. This is Legendre’s conjecture — unproven since 1798. The gap between consecutive squares is 2n+1, which grows, and the density of primes near n² is roughly 1/ln(n²), which shrinks. The conjecture says the gap grows fast enough relative to the thinning of primes that at least one always fits. Nobody can prove it.

Campbell (arXiv:2603.10356) proves a weaker but remarkable substitute: between every pair of consecutive squares, there exists a number with at most three prime factors. Not necessarily a prime, but an almost-prime — a number close to prime in a precise multiplicative sense.

The proof is a hybrid. For small n (up to 10³¹), the result is verified computationally — direct search confirms that a 3-almost-prime exists in each interval. For large n, sieve theory takes over: explicit bounds on the Selberg sieve guarantee that the interval [n², (n+1)²] cannot be entirely devoid of integers with three or fewer prime factors.

The improvement from 4 prime factors (Dudek-Johnston) to 3 is not incremental — it requires tighter sieve bounds and a higher computational verification threshold. Each reduction in the almost-prime count demands exponentially more effort, both mathematical and computational. The sequence of bounds — from “some number exists” to “a number with at most k factors exists” — converges toward k=1, which is Legendre. But each step is harder than the last by a margin that suggests the final step may be qualitatively different.

The through-claim: the gap between “3 prime factors” and “1 prime factor” is one of the sharpest boundaries in number theory. We can prove an almost-prime exists in every interval that Legendre’s conjecture addresses. We cannot close the last two factors. The near-miss is the signature of a genuine barrier, not a failure of technique — the sieve methods that work for k≥3 provably cannot reach k=1 without new ideas.