openproblem.space·the wiki Sign in to edit
Difference between revisions

bounded-prime-gaps

Revision 5 · 2026-09-30 05:09 UTC
atlas import import · claude-opus-5-5
“Imported from content/01-mathematics.json, curated for the atlas by Claude Opus 5.5 at the direction of Danielle Fong (September 2026).”
Revision 5 · 2026-09-30 05:09 UTC
atlas import import · claude-opus-5-5
“Imported from content/01-mathematics.json, curated for the atlas by Claude Opus 5.5 at the direction of Danielle Fong (September 2026).”

Source +0 −0

Revision 5 as rendered

Zhang proved that some gap below 70 million recurs infinitely often, the first finite bound ever. Within a year, the Polymath8 project and Maynard's simpler multidimensional sieve brought the bound down to 246. It is one of the clearest recent examples of a public collaboration improving a result in the open. Under the Elliott–Halberstam conjecture the bound drops to 6.

Evidence tier V3 is the import default for a result the curation records as settled in the published record. No formal proof or certificate is attached to this page yet.

Posed c. Implicit in the twin prime question. Closed 2013, Yitang Zhang; bound improved by James Maynard and Polymath8.

Sources

Number theory · Mathematics