Legendre’s Conjecture: A Prime Between Every Two Squares?

Quick answer: Legendre’s conjecture says that for every positive integer n there is at least one prime number between n² and (n+1)². For example, 5 and 7 lie between 4 and 9. It has been checked by computer for every n up to about 7 × 10^13 but is still unproved. Mathematicians have proved weaker versions, such as a prime between consecutive cubes for very large n.

Write down the perfect squares 1, 4, 9, 16, 25, … and look at the gaps between them. Every gap you check contains at least one prime. Adrien-Marie Legendre noticed this around 1800, and it seems almost too obvious to doubt. Yet more than two centuries later, no one can prove it.

The Statement

For every integer \(n \ge 1\), there is a prime \(p\) with

\[ n^2 < p < (n+1)^2. \]

\(n\)IntervalPrimes in itCount
11 to 42, 32
24 to 95, 72
39 to 1611, 132
416 to 2517, 19, 233
525 to 3629, 312
10100 to 121101, 103, 107, 109, 1135

You can test bigger cases with our prime number checker. The gap between \(n^2\) and \((n+1)^2\) is \(2n + 1\), and the prime number theorem suggests it should contain about \(n / \ln n\) primes, a number that grows without limit. So the conjecture looks very safe. The problem is turning “on average” into “every single time.”

One of Landau’s Four Problems

At the 1912 International Congress of Mathematicians, Edmund Landau called four prime problems “unattackable with the present state of science.” All four are still open:

What Has Been Proved

ResultWho and when
A prime between \(n\) and \(2n\) (Bertrand’s postulate)Chebyshev (1852)
A prime between \(n^3\) and \((n+1)^3\) for all large \(n\)Ingham (1937); made explicit by Dudek (2016) and Cully-Hugill (2023), for astronomically large \(n\)
A prime in \([x – x^{0.525}, x]\) for all large \(x\)Baker, Harman and Pintz (2001), a landmark short-interval theorem
A number with at most 2 prime factors (counted with multiplicity) between \(n^2\) and \((n+1)^2\), for all sufficiently large \(n\)Chen Jingrun (1975)
A number with at most 3 prime factors between every pair of consecutive squares, for every \(n\)Peter J. Campbell (2026)
Assuming RH: the interval \([x^{2.25}, (x+1)^{2.25}]\) contains a prime for every real \(x \ge 1\)Marc Chamberland and Armin Straub (2026, American Mathematical Monthly)

Computers confirm the conjecture far out. Jonathan Sorenson and Jonathan Webster (Research in Number Theory, 2025) verified it for every \(n \le 7.05 \times 10^{13}\). Note the difference between Chen’s result (2 prime factors, but only for large \(n\)) and Campbell’s (3 prime factors, but for every \(n\)).

Why the Usual RH Bounds Do Not Prove Legendre’s Conjecture

On November 21, 2026, the Lean and Mathlib communities certified the statement and formal proof of the Riemann Hypothesis released by Levent Alpöge the day before; the Clay Institute’s page still lists RH as unsolved. Even so, the standard consequence of RH guarantees a prime in intervals of length on the order of \(\sqrt{x} \ln x\) near \(x\). Near \(x = n^2\), the gap between squares is only about \(2\sqrt{x}\), smaller by a factor of \(\ln x\). So the usual RH bound falls just short (which does not rule out some other argument from RH). Chamberland and Straub show that RH, combined with large computations, gives a prime in \([x^{2.25}, (x+1)^{2.25}]\) for every real \(x \ge 1\), and they discuss pushing the exponent to about 2.2253.

Common Misconceptions

“Checking billions of cases proves it.” No. Numerical evidence is strong, but a single failure further out would disprove it.

“Bertrand’s postulate already covers it.” No. Bertrand gives a prime between \(n\) and \(2n\), a much wider interval than \(n^2\) to \(n^2 + 2n + 1\).

Watch: Legendre’s Conjecture in Video

If you learn better by watching, these videos are worth your time.

Legendre’s conjecture | Landau’s problems | Unsolved problems (Ishan Banerjee). A short introduction to the conjecture and its place among Landau’s problems.
Mathematicians are stumped by Legendre’s Conjecture. WHY? (Mathrodite). Why the conjecture is so hard to prove.

Check Your Understanding

Five quick questions to see how much of this has stuck. Pick an answer and press Submit; you will see a short explanation either way.

Answer each question and press Submit to see your result right away.

1. Which primes lie between 4 and 9?
Found a bug? Let us know!
2. How many integers lie strictly between n² and (n+1)²?
Found a bug? Let us know!
3. Who listed Legendre’s conjecture among four “unattackable” problems in 1912?
Found a bug? Let us know!
4. What did Ingham prove in 1937?
Found a bug? Let us know!
5. Does the standard RH prime-gap bound prove Legendre’s conjecture?
Found a bug? Let us know!

Frequently Asked Questions

What is Legendre’s conjecture?

It states that there is always at least one prime number between n² and (n+1)² for every positive integer n.

Has Legendre’s conjecture been proved?

No. As of November 2026 it is open. It has been verified for all n up to about 7 × 10^13, and weaker versions, such as primes between consecutive cubes for large n, are proved.

Does the Riemann Hypothesis imply Legendre’s conjecture?

Not by the standard argument. RH bounds prime gaps by about √x ln x, slightly too large to guarantee a prime between consecutive squares.

What are Landau’s problems?

Four prime problems Edmund Landau listed in 1912: Goldbach’s conjecture, the twin prime conjecture, Legendre’s conjecture, and whether there are infinitely many primes of the form n² + 1.

Keep Exploring

Sources and Further Reading

Related to This Article

What people say about "Legendre’s Conjecture: A Prime Between Every Two Squares? - Effortless Math"?

No one replied yet.

Leave a Reply