Brocard's conjecture
Brocard's conjecture is a conjecture.
All 2 facts, and where they come from
Facts
2 facts · 0 confirmed by two sources · 0 cited · 2 from one source
Where this comes from
Papalocal keeps its own record. It started from these sources; what each one said is kept here as it was copied, so a change on their side never changes this page by itself. Tap one to read its version.
What Wikidata says · copied November 18, 2026 · revision 2567513562
- Described as
- conjecture
- What it is
- conjecture
- Named after
- Henri Brocard
- Wikipedias with a page
- 17
Wikidata item Q509160 (wikidata.org/wiki/Q509160), public domain (CC0). Copied 2026-11-18.
What Wikipedia says · copied November 18, 2026 · revision 1383631140
In number theory, Brocard's conjecture is the conjecture that there are at least four prime numbers between (pn)2 and (pn+1)2, where pn is the nth prime number, for every n ≥ 2. The conjecture is named after Henri Brocard. It is widely believed that this conjecture is true. However, it remains unproven as of 2025. Legendre's conjecture, which states that there is a prime between consecutive integer squares, directly implies that there are at least two primes between prime squares for pn ≥ 3 since pn+1 − pn ≥ 2.
From the Wikipedia article “Brocard's conjecture” (en.wikipedia.org/wiki/Brocard's_conjecture), by its contributors, under CC BY-SA 4.0 (creativecommons.org/licenses/by-sa/4.0/). Copied 2026-11-18; not changed.
Confirmed Two sources agree. Cited One source, and it names where it got it. One source One source, without a reference of its own. Sources disagree The sources disagree. We show the best-supported value and keep theirs below.
