Papalocal
Loading…
Papalocal · Things
Work

Goldbach's weak conjecture

Goldbach's weak conjecture is a conjecture about prime numbers.

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
conjecture One source
Named after

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 2566977939
Described as
conjecture about prime numbers
Other names
weak Goldbach conjecture, weak Goldbach theorem, Goldbach's weak theorem
What it is
conjecture
Named after
Christian Goldbach
Wikipedias with a page
24

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

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

In number theory, Goldbach's weak conjecture, also known as the odd Goldbach conjecture, the ternary Goldbach problem, or the 3-primes problem, is the proposition that every odd number greater than 5 can be expressed as the sum of three (not necessarily distinct) primes.
This conjecture is called "weak" because it is implied by Goldbach's strong conjecture concerning sums of two primes: indeed, if every even number greater than 4 is the sum of two odd primes, adding 3 to each even number greater than 4 will produce the odd numbers greater than 7 (and 7 itself is equal to 2 + 2 + 3). However, you cannot work backward to prove the strong conjecture from the weak one.
In 2013, Harald Helfgott released a supposed proof of Goldbach's weak conjecture. The proof was accepted for publication in the Annals of Mathematics Studies series in 2015, and has been undergoing further review and revision since; fully refereed chapters in close to final form are being made public in the process. If the proof is accepted, it will promote the conjecture to the status of theorem.
Some state the conjecture as

Every odd number greater than 7 can be expressed as the sum of three odd primes.
This version excludes 7 = 2 + 2 + 3, as 7 requires the even prime 2. On odd numbers larger than 7 it is slightly stronger as it also excludes sums like 17 = 2 + 2 + 13, which are allowed in the other formulation. Helfgott's proof covers both versions of the conjecture. Like the other formulation, this one also immediately follows from Goldbach's strong conjecture.

From the Wikipedia article “Goldbach's weak conjecture” (en.wikipedia.org/wiki/Goldbach's_weak_conjecture), 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