Goldbach's conjecture

History

Origins

On 7 June 1742, the Prussian mathematician Christian Goldbach wrote a letter to Leonhard Euler (letter XLIII), in which he proposed the following conjecture:

Every integer that can be written as the sum of two primes can also be written as the sum of as many primes (including unity) as one wishes, until all terms are units.

Goldbach was following the now-abandoned convention of considering 1 to be a prime number, so that a sum of units would be a sum of primes. He then proposed a second conjecture in the margin of his letter, which implies the first:

It seems at least, that every integer greater than 2 can be written as the sum of three primes.

Euler replied in a letter dated 30 June 1742 and reminded Goldbach of an earlier conversation they had had ("... so Ew. vormals mit mir communicirt haben ..."), in which Goldbach had remarked that the first of those two conjectures would follow from the statement

This is in fact equivalent to his second, marginal conjecture. In the letter dated 30 June 1742, Euler stated:{{cite web |archive-url = https://web.archive.org/web/20030616020619/http://claymath.org/Popular_Lectures/U_Texas/Riemann_1.pdf |url-status = dead |archive-date = 2003-06-16 |access-date = 2009-09-23 | access-date = 2008-08-13 | archive-date = 2008-09-18 | archive-url = https://web.archive.org/web/20080918221738/http://primes.utm.edu/glossary/page.php?sort=GoldbachConjecture | url-status = live

That ... every even integer is a sum of two primes, I regard as a completely certain theorem, although I cannot prove it.

Similar conjecture by Descartes

René Descartes wrote, "Every even number can be expressed as the sum of at most three primes." This proposition is similar to, but weaker than, Goldbach's conjecture. Paul Erdős said, "Descartes actually discovered this before Goldbach ... but it is better that the conjecture was named for Goldbach because, mathematically speaking, Descartes was infinitely rich and Goldbach was very poor."

Partial results

Goldbach's conjecture involving the sum of two primes is much more difficult than the weak Goldbach conjecture, which says that every odd integer greater than 5 is the sum of three primes. Using Vinogradov's method, Nikolai Chudakov, Johannes van der Corput, and Theodor Estermann showed (1937–1938) that almost all even numbers can be written as the sum of two primes (in the sense that the fraction of even numbers up to some N which can be so written tends towards 1 as N increases). In 1930, Lev Schnirelmann proved that any natural number greater than 1 can be written as the sum of not more than C prime numbers, where C is an effectively computable constant; see Schnirelmann density. Schnirelmann's constant is the lowest number C with this property. Schnirelmann himself obtained {{math|C

In 1924, Hardy and Littlewood showed under the assumption of the generalized Riemann hypothesis that the number of even numbers up to X violating the Goldbach conjecture is much less than X + c for small c.

In 1948, using sieve theory methods, Alfréd Rényi showed that every sufficiently large even number can be written as the sum of a prime and an almost prime with at most K factors. Chen Jingrun showed in 1973 using sieve theory that every sufficiently large even number can be written as the sum of either two primes, or a prime and a semiprime (the product of two primes). See Chen's theorem for further information.

In 1975, Hugh Lowell Montgomery and Bob Vaughan showed that "most" even numbers are expressible as the sum of two primes. More precisely, they showed that there exist positive constants c and C such that for all sufficiently large numbers N, every even number less than N is the sum of two primes, with at most CN1 − c exceptions. In particular, the set of even integers that are not the sum of two primes has density zero.

In 1951, Yuri Linnik proved the existence of a constant K such that every sufficiently large even number is the sum of two primes and at most K powers of 2. János Pintz and Imre Ruzsa found in 2020 that works. Assuming the generalized Riemann hypothesis, also works, as shown by Roger Heath-Brown and Jan-Christoph Schlage-Puchta in 2002.

In 2013, Harald Helfgott submitted a proof of the weak conjecture to the Annals of Mathematics Studies book series. The article was accepted, but Helfgott decided to undertake major modifications suggested by the referee. The weak conjecture is implied by the Goldbach conjecture, as if n − 3 is a sum of two primes, then n is a sum of three primes. But the converse implication and thus the Goldbach conjecture remain unproven even if Helfgott's proof is correct.

Computational results

For small values of n, the Goldbach conjecture (and hence the weak Goldbach conjecture) can be verified directly. For instance, in 1938, Nils Pipping laboriously verified the conjecture up to . With the advent of computers, many more values of n have been checked; T. Oliveira e Silva ran a distributed computer search that has verified the conjecture for n ≤ (and double-checked up to ) as of 2013. One record from this search is that is the smallest number that cannot be written as a sum of two primes where one is smaller than 9781.

In popular culture

Goldbach's Conjecture () is the title of Xu Chi's biography of Chinese mathematician and number theorist Chen Jingrun.

The conjecture is a central point in the plot of Apostolos Doxiadis's 1992 novel Uncle Petros and Goldbach's Conjecture, in Isaac Asimov's short story "Sixty Million Trillion Combinations", and in Michelle Richmond's 2008 mystery novel No One You Know.

Goldbach's conjecture is part of the plot of the 2007 Spanish film Fermat's Room.

Goldbach's conjecture is featured as the main topic of research of the eponymous character Marguerite in the 2023 French-Swiss film Marguerite's Theorem.Morain, Odile. Le Théorème de Marguerite . franceinfo:culture

Formal statement

Each of the three conjectures has a natural analog in terms of the modern definition of a prime, under which 1 is excluded. A modern version of the first conjecture is: A modern version of the marginal conjecture is:

And a modern version of Goldbach's older conjecture of which Euler reminded him is:

These modern versions might not be entirely equivalent to the corresponding original statements. For example, if there were an even integer larger than 4, for p a prime, that could not be expressed as the sum of two primes in the modern sense, then it would be a counterexample to the modern version of the third conjecture (without being a counterexample to the original version). The modern version is thus probably stronger (but in order to confirm that, one would have to prove that the first version, freely applied to any positive even integer n, could not possibly rule out the existence of such a specific counterexample N). In any case, the modern statements have the same relationships with each other as the older statements did. That is, the second and third modern statements are equivalent, and either implies the first modern statement.

The third modern statement (equivalent to the second) is the form in which the conjecture is usually expressed today. It is also known as the "strong", "even", or "binary" Goldbach conjecture. A weaker form of the second modern statement, known as "Goldbach's weak conjecture", the "odd Goldbach conjecture", or the "ternary Goldbach conjecture", asserts that

Heuristic justification

Statistical considerations that focus on the probabilistic distribution of prime numbers present informal evidence in favour of the conjecture (in both the weak and strong forms) for sufficiently large integers: the greater the integer, the more ways there are available for that number to be represented as the sum of two or three other numbers and the more "likely" it becomes that at least one of these representations consists entirely of primes.

A very crude version of the heuristic probabilistic argument (for the strong form of the Goldbach conjecture) is as follows. The prime number theorem asserts that an integer m selected at random has roughly a chance of being prime. Thus if n is a large even integer and m is a number between 3 and , then one might expect the probability of m and n − m simultaneously being prime to be . If one pursues this heuristic, one might expect the total number of ways to write a large even integer n as the sum of two odd primes to be roughly

\sum_{m=3}^\frac{n}{2} \frac{1}{\ln m} \frac{1}{\ln(n - m)} \approx \frac{n}{2 (\ln n)^2}.

Since ln n ≪ , this quantity goes to infinity as n increases, and one would expect that every large even integer has not just one representation as the sum of two primes, but in fact very many such representations.

This heuristic argument is actually somewhat inaccurate because it assumes that the events of m and n − m being prime are statistically independent of each other. For instance, if m is odd, then n − m is also odd, and if m is even, then n − m is even, a non-trivial relation because, besides the number 2, only odd numbers can be prime. Similarly, if n is divisible by 3, and m was already a prime other than 3, then n − m would also be coprime to 3 and thus be slightly more likely to be prime than a general number. Pursuing this type of analysis more carefully, G. H. Hardy and John Edensor Littlewood in 1923 conjectured (as part of their Hardy–Littlewood prime tuple conjecture) that for any fixed c ≥ 2, the number of representations of a large integer n as the sum of c primes with p1 ≤ ⋯ ≤ pc should be asymptotically equal to

\left(\prod_p \frac{p \gamma_{c,p}(n)}{(p - 1)^c}\right) \int_{2 \leq x_1 \leq \cdots \leq x_c: x_1 + \cdots + x_c = n} \frac{dx_1 \cdots dx_{c-1}}{\ln x_1 \cdots \ln x_c},

where the product is over all primes p, and γ**c,p(n) is the number of solutions to the equation in modular arithmetic, subject to the constraints q1, ..., qc ≠ 0 mod p. This formula has been rigorously proven to be asymptotically valid for c ≥ 3 from the work of Ivan Matveevich Vinogradov, but is still only a conjecture when . In the latter case, the above formula simplifies to 0 when n is odd, and to

2 \Pi_2 \left(\prod_{p \mid n; p \geq 3} \frac{p - 1}{p - 2}\right) \int_2^n \frac{dx}{(\ln x)^2} \approx 2 \Pi_2 \left(\prod_{p \mid n; p \geq 3} \frac{p - 1}{p - 2}\right) \frac{n}{(\ln n)^2}

when n is even, where Π2 is Hardy–Littlewood's twin prime constant

\Pi_2 := \prod_{p;{\rm prime} \ge 3} \left(1 - \frac{1}{(p-1)^2}\right) \approx 0.66016,18158,46869,57392,78121,10014\dots

This is sometimes known as the extended Goldbach conjecture. The Goldbach conjecture is in fact very similar to the twin prime conjecture, and the two conjectures are believed to be of roughly comparable difficulty.

Goldbach partition function

The * function* associates to each even integer the number of ways it can be decomposed into a sum of two primes. Its graph looks like a comet and is therefore called Goldbach's comet.

Goldbach's comet suggests tight upper and lower bounds on the number of representations of an even number as the sum of two primes, and also that the number of these representations depends strongly on the value modulo 3 of the number.

Related problems

Although Goldbach's conjecture implies that every positive integer greater than one can be written as a sum of at most three primes, it is not always possible to find such a sum using a greedy algorithm that uses the largest possible prime at each step. The Pillai sequence tracks the numbers requiring the largest number of primes in their greedy representations.

Similar problems to Goldbach's conjecture exist in which primes are replaced by other particular sets of numbers, such as the squares:

• Lagrange proved that every positive integer is the sum of four squares. See Waring's problem and the related Waring–Goldbach problem on sums of powers of primes.
• Hardy and Littlewood listed as their Conjecture I: "Every large odd number (n 5) is the sum of a prime and the double of a prime". This conjecture is known as Lemoine's conjecture and is also called Levy's conjecture.
• The Goldbach conjecture for practical numbers, a prime-like sequence of integers, was stated by Margenstern in 1984, and proved by Melfi in 1996: every even number is a sum of two practical numbers.
• Harvey Dubner proposed a strengthening of the Goldbach conjecture: that every even integer greater than 4208 is the sum of two twin primes (not necessarily belonging to the same pair). Only 34 even integers less than 4208 are not the sum of two twin primes; Dubner has verified computationally that this list is complete up to 2\cdot 10^{10}. A proof of this stronger conjecture would imply not only Goldbach's conjecture but also the twin prime conjecture.

Goldbach's conjecture is used to study computational complexity. The connection is made through the Busy Beaver function, where BB(n) is the maximum number of steps taken by any n state Turing machine that halts. There is a 27-state Turing machine that halts if and only if Goldbach's conjecture is false. Hence if BB(27) was known, and the Turing machine did not stop in that number of steps, it would be known to run forever and hence no counterexamples would exist (proving the conjecture). This is a completely impractical way to settle the conjecture; instead it is used to suggest that BB(27) will be very hard to compute, at least as difficult as settling the Goldbach conjecture.

Notes

References

References

1. Goldbach, Christian. (1843). "Correspondance mathématique et physique de quelques célèbres géomètres du XVIIIème siècle". [[Russian Academy of Sciences.
2. (7 June 1742). "Letter XLIII, Goldbach to Euler". Mathematical Association of America.
3. "Goldbach Conjecture".
4. (30 June 1742). "Letter XLIV, Euler to Goldbach". Mathematical Association of America.
5. Pintz, János. [https://real.mtak.hu/164172/1/PJ_DESCARTES_Conjecture1109.pdf "On a conjecture of Descartes"]. ELKH Rényi Mathematical Institute of the Hungarian Academy of Sciences. Retrieved 20 June 2025.
6. Hoffman, Paul. (1998). "The Man Who Loved Only Numbers". Hyperion Books.
7. Chudakov. Nikolai G.. (1937). [[Doklady Akademii Nauk SSSR]]
8. Van der Corput, J. G.. (1938). "Sur l'hypothèse de Goldbach". Proceedings of the Koninklijke Nederlandse Akademie van Wetenschappen Amsterdam.
9. Estermann, T.. (1938). "On Goldbach's problem: proof that almost all even positive integers are sums of two primes". Proceedings of the London Mathematical Society.
10. Schnirelmann, L. G. (1930). [http://mi.mathnet.ru/eng/umn/y1939/i6/p9 'On the additive properties of numbers"]. First published in ''Proceedings of the Don Polytechnic Institute in Novocherkassk'' (in Russian), vol '''14''' (1930), pp. 3–27, and reprinted in ''Uspekhi Matematicheskikh Nauk'' (in Russian), 1939, no. 6, 9–25.
11. Schnirelmann, L. G. (1933). First published as [https://link.springer.com/article/10.1007/BF01448914 "Über additive Eigenschaften von Zahlen"] {{Webarchive. link. (2017-10-27 . In ''[[Mathematische Annalen]]'' (in German), vol. '''107''' (1933), 649–690, and reprinted as [http://mi.mathnet.ru/eng/umn/y1940/i7/p7 "On the additive properties of numbers"] in ''Uspekhi Matematicheskikh Nauk'' (in Russian), 1940, no. 7, 7–46.)
12. Helfgott, H. A.. (2013). "The ternary Goldbach conjecture is true".
13. Sinisalo, Matti K.. (October 1993). "Checking the Goldbach Conjecture up to 4 ⋅ 10¹¹". American Mathematical Society.
14. Rassias, M. Th.. (2017). "Goldbach's Problem: Selected Topics". Springer.
15. See, for example, ''A new explicit formula in the additive theory of primes with applications I. The explicit formula for the Goldbach and Generalized Twin Prime Problems'' by Janos Pintz.
16. Rényi, A. A.. (1948). "On the representation of an even number as the sum of a prime and an almost prime". Izvestiya Akademii Nauk SSSR. Seriya Matematicheskaya.
17. Chen, J. R.. (1973). "On the representation of a larger even integer as the sum of a prime and the product of at most two primes". Scientia Sinica.
18. (2020-08-01). "On Linnik's approximation to Goldbach's problem. II". [[Acta Mathematica Hungarica]].
19. (2002). "Integers represented as a sum of primes and powers of two". [[Asian Journal of Mathematics]].
20. Helfgott, H. A.. (2013). "Major arcs for Goldbach's theorem".
21. Helfgott, H. A.. (2012). "Minor arcs for Goldbach's problem".
22. "Harald Andrés Helfgott". Institut de Mathématiques de Jussieu-Paris Rive Gauche.
23. Pipping, Nils (1890–1982). "Die Goldbachsche Vermutung und der Goldbach-Vinogradowsche Satz". ''Acta Academiae Aboensis, Mathematica et physica'' 11, 4–25, 1938.
24. (July 2014). "Empirical Verification of the Even Goldbach Conjecture and Computation of up to 4 · 10¹⁸". [[American Mathematical Society]].
25. Kasman, Alex. "MathFiction: No One You Know (Michelle Richmond)". College of Charleston.
26. (1989). "Goldbach's Comet: the numbers related to Goldbach's Conjecture". Journal of Recreational Mathematics.
27. {{Cite OEIS. A066352
28. ''[[Mathematics Magazine]]'', 66:1 (1993): 45–47.
29. Margenstern, M.. (1984). "Results and conjectures about practical numbers". [[Comptes rendus de l'Académie des Sciences]].
30. Melfi, G.. (1996). "On two conjectures about practical numbers". [[Journal of Number Theory]].
31. "TWIN PRIME CONJECTURES".
32. {{Cite OEIS. A007534
33. (10 December 2020). "How the Slowest Computer Programs Illuminate Math's Fundamental Limits".