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

weak-goldbach

Revision 7 · 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 7 · 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 7 as rendered

Vinogradov proved in 1937 that it holds for all sufficiently large odd numbers, but the threshold was astronomically large. Helfgott sharpened the circle method until the threshold fell to a range that a computer had already checked. It shows a common endgame: an asymptotic proof, then decades of bookkeeping to make its constants small.

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 1742, from the Goldbach–Euler correspondence. Closed 2013, Harald Helfgott.

Sources

Number theory · Mathematics