Papalocal
Loading…
Papalocal · Things
Work

Vinogradov's theorem

Vinogradov's theorem is a theorem stating that a sufficiently large odd integer is the sum of three primes.

All 2 facts, and where they come from

Facts

2 facts · 0 confirmed by two sources · 0 cited · 2 from one source

What it is
theorem One source
Named after
Ivan Vinogradov 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 17, 2026 · revision 2541589081
Described as
theorem stating that a sufficiently large odd integer is the sum of three primes
What it is
theorem
Named after
Ivan Vinogradov
Wikipedias with a page
14

Wikidata item Q1694565 (wikidata.org/wiki/Q1694565), public domain (CC0). Copied 2026-11-17.

What Wikipedia says · copied November 17, 2026 · revision 1353924735

In number theory, Vinogradov's theorem is a result which implies that any sufficiently large odd integer can be written as a sum of three prime numbers. It is a weaker form of Goldbach's weak conjecture, which would imply the existence of such a representation for all odd integers greater than five. It is named after Ivan Matveyevich Vinogradov, who proved it in the 1930s. Hardy and Littlewood had shown earlier that this result followed from the generalized Riemann hypothesis, and Vinogradov was able to remove this assumption. The full statement of Vinogradov's theorem gives asymptotic bounds on the number of representations of an odd integer as a sum of three primes. The notion of "sufficiently large" was ill-defined in Vinogradov's original work, but in 2002 it was shown that 101346 is sufficiently large. Additionally numbers up to 1020 had been checked via brute force methods, thus only a finite number of cases to check remained before the odd Goldbach conjecture would be proven or disproven. In 2013, Harald Helfgott claimed to have proved Goldbach's weak conjecture for all cases.

From the Wikipedia article “Vinogradov's theorem” (en.wikipedia.org/wiki/Vinogradov's_theorem), by its contributors, under CC BY-SA 4.0 (creativecommons.org/licenses/by-sa/4.0/). Copied 2026-11-17; 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.

People connected 1

Known for it