Legendre’s Conjecture: Do Primes Always Appear Between Consecutive Perfect Squares?
Legendre’s conjecture is one of those rare problems in mathematics that can be stated in a single sentence yet has remained unproven for over two centuries. Simple to formulate, it touches on two of the most fundamental objects in number theory — prime numbers and perfect squares — and its resolution remains one of the great open challenges in the field.
What Legendre’s Conjecture Says About Primes and Perfect Squares
A quick note before we begin: in a previous post, there was a small inaccuracy in the title. Prime numbers, with the exception of 2, are also odd — which means they all belong to the sequence of odd numbers that sum together to form perfect squares. But the connection between primes and squares goes deeper than that, and leads us to a more interesting, equally simple, and still unsolved problem.
That problem is Legendre’s conjecture:
Between any two consecutive perfect squares, there is always at least one prime number.
For example, between 10² = 100 and 11² = 121, we find the primes 101, 103, 107, 109, and 113. The conjecture asserts that this holds for every natural number — no matter how large the squares get, at least one prime will always lie between them.
Why Legendre’s Conjecture Has Resisted Proof
At first glance, the conjecture seems almost obvious. On average, the gap between consecutive primes near a number x is approximately ln(x). The length of the interval between consecutive squares near x, meanwhile, is roughly 2√x. Since √x grows far faster than ln(x), a prime seems almost guaranteed to appear in every such interval.
The problem is that this is only average behavior. Proving the conjecture requires ruling out even a single interval between consecutive squares that contains no prime at all — and current mathematical methods are not powerful enough to do that.
Legendre’s Conjecture and the Riemann Hypothesis
What makes this especially striking is that even the Riemann hypothesis, on its own, is not sufficient to prove Legendre’s conjecture. The Riemann hypothesis gives us extremely precise control over how primes are distributed, yet the gaps it can guarantee are still not tight enough to settle the question.
This puts Legendre’s conjecture in rare company: a problem that lies just beyond the reach of one of the most powerful unproven tools in all of mathematics.
Computational Verification and Recent Progress on Legendre’s Conjecture
The computational evidence, however, is overwhelming. The conjecture has been verified for all n ≤ 7.05 × 10¹³ — meaning that for every such n, at least one prime has been explicitly found between n² and (n + 1)². Not a single counterexample has ever been discovered.
The most significant recent theoretical advance came this year: mathematicians proved that between any two consecutive perfect squares, there always exists a number with at most three prime factors. This is a meaningful step forward — but the distance between this result and a full proof of Legendre’s conjecture remains very great.
