Goldbach's conjecture

Goldbach's conjecture

Letter from Goldbach to Euler dated on 7 June 1742 (Latin-German)[1]
Field	Number theory
Conjectured by	Christian Goldbach
Conjectured in	1742
Open problem	Yes
Consequences	Goldbach's weak conjecture

Goldbach's conjecture is one of the oldest and best-known unsolved problems in number theory and all of mathematics. It states that every even whole number greater than 2 is the sum of two prime numbers.^[2]

The conjecture has been shown to hold for all integers less than 4 × 10¹⁸,^[3][4] but remains unproven despite considerable effort.

History[]

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

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

Euler replied in a letter dated 30 June 1742^[7] 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:^[8][9]

Dass ... ein jeder numerus par eine summa duorum primorum sey, halte ich für ein ganz gewisses theorema, ungeachtet ich dasselbe nicht demonstriren kann.
That ... every even integer is a sum of two primes, I regard as a completely certain theorem, although I cannot prove it.

Each of the three conjectures above 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 ${\displaystyle N=p+1}$ larger than 4, for ${\displaystyle 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 ${\displaystyle n}$, could not possibly rule out the existence of such a specific counterexample ${\displaystyle 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

A proof for the weak conjecture was proposed in 2013 by Harald Helfgott. Helfgott's proof has not yet appeared in a peer-reviewed publication, though was accepted for publication in the series in 2015, and has been undergoing further review and revision since.^[10][11][12] The weak conjecture would be a corollary of the strong conjecture: if n – 3 is a sum of two primes, then n is a sum of three primes. However, the converse implication and thus the strong Goldbach conjecture remain unproven.

Verified results[]

For small values of n, the strong Goldbach conjecture (and hence the weak Goldbach conjecture) can be verified directly. For instance, in 1938, Nils Pipping laboriously verified the conjecture up to n ≤ 10⁵.^[13] 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 ≤ 4 × 10¹⁸ (and double-checked up to 4 × 10¹⁷) as of 2013. One record from this search is that 3325581707333960528 is the smallest number that cannot be written as a sum of two primes where one is smaller than 9781.^[14]

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.

Number of ways to write an even number n as the sum of two primes (4 ≤ n ≤ 1,000), (sequence A002375 in the OEIS)

Number of ways to write an even number n as the sum of two primes (4 ≤ n ≤ 1000000)

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 ${\displaystyle 1/\ln m}$ chance of being prime. Thus if n is a large even integer and m is a number between 3 and n/2, then one might expect the probability of m and n − m simultaneously being prime to be ${\displaystyle 1{\big /}{\big [}\ln m\,\ln(n-m){\big ]}}$. 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

${\displaystyle \sum _{m=3}^{n/2}{\frac {1}{\ln m}}{\frac {1}{\ln(n-m)}}\approx {\frac {n}{2(\ln n)^{2}}}.}$

Since ${\displaystyle \ln n\ll {\sqrt {n}}}$, this quantity goes to infinity as n increases, and we 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 distinct from 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 ${\displaystyle n=p_{1}+\cdots +p_{c}}$ with ${\displaystyle p_{1}\leq \cdots \leq p_{c}}$ should be asymptotically equal to

${\displaystyle \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 ${\displaystyle \gamma _{c,p}(n)}$ is the number of solutions to the equation ${\displaystyle n=q_{1}+\cdots +q_{c}\mod p}$ in modular arithmetic, subject to the constraints ${\displaystyle q_{1},\ldots ,q_{c}\neq 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 ${\displaystyle c=2}$.^{[citation needed]} In the latter case, the above formula simplifies to 0 when n is odd, and to

${\displaystyle 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 ${\displaystyle \Pi _{2}}$ is Hardy–Littlewood's twin prime constant

${\displaystyle \Pi _{2}:=\prod _{\textstyle {p\;{\rm {prime}} \atop p\geq 3}}\left(1-{\frac {1}{(p-1)^{2}}}\right)\approx 0.660161815846869573927812110014\dots }$

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

The Goldbach partition functions shown here can be displayed as histograms, which illustrate the above equations. See Goldbach's comet^[15] for more information.

Goldbach's comet also suggests that there are tight upper and lower bounds on the number of representatives, and that the modulo 6 of 2n plays a part in the number of representations.

The number of representations is about ${\displaystyle n\ln n}$, from ${\displaystyle 2n=p+c}$ and the Prime Number Theorem. If each c is composite, then it must have a prime factor less than or equal to the square root of ${\displaystyle 2n}$, by the method outlined in trial division.

This leads to an expectation of ${\displaystyle {\frac {n\ln n}{\sqrt {2n}}}={\sqrt {\frac {n}{2}}}\ln n}$ representations.

Rigorous results[]

The strong Goldbach conjecture is much more difficult than the weak Goldbach conjecture. Using Vinogradov's method, Nikolai Chudakov,^[16] Johannes van der Corput,^[17] and Theodor Estermann^[18] showed that almost all even numbers can be written as the sum of two primes (in the sense that the fraction of even numbers which can be so written tends towards 1). 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.^[19][20] Schnirelmann's constant is the lowest number C with this property. Schnirelmann himself obtained C < 800000. This result was subsequently enhanced by many authors, such as Olivier Ramaré, who in 1995 showed that every even number n ≥ 4 is in fact the sum of at most 6 primes. The best known result currently stems from the proof of the weak Goldbach conjecture by Harald Helfgott,^[21] which directly implies that every even number n ≥ 4 is the sum of at most 4 primes.^[22][23]

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 ${\displaystyle X^{(1/2)+c}}$ for small c.^[24]

Chen Jingrun showed in 1973 using the methods of 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).^[25] See Chen's theorem for further information.

In 1975, Hugh Montgomery and Robert Charles 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 ${\displaystyle CN^{1-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. Roger Heath-Brown and found in 2002 that K = 13 works.^[26]

Twin primes[]

A twin prime is a prime number p such either p − 2 or p + 2 (or both) is prime.

A strengthening of the Goldbach conjecture, proposed independently by Steven Prowse and Harvey Dubner^[27] is that every even integer greater than 4,208 is the sum of two twin primes.

The following even numbers are the only ones that are known to not be the sum of two twin primes:

94, 96, 98, 400, 402, 404, 514, 516, 518, 784, 786, 788, 904, 906, 908, 1114, 1116, 1118,

1144, 1146, 1148, 1264, 1266, 1268, 1354, 1356, 1358, 3244, 3246, 3248, 4204, 4206, 4208

(this list consists of eleven sets of three consecutive even numbers).

Prowse and Dubner verified with the use of computers that this list is complete up to 2×10¹⁰.

A proof of Prowse–Dubner would imply that there would be infinitely many twin primes, an unproved conjecture known as the twin prime conjecture.

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.^[28]

Golbach's conjecture is also related to Pillai's conjecture since of order two represent solutions to its generalized difference equation.^[29] However, Goldbug numbers of higher orders generalize Pillai's conjecture equation in a way that has not previously been considered. A proof that only finitely many Goldbug numbers exist would be a proof of Goldbach's conjecture. It has been verified computationally that there are no additional Goldbugs less than 5×10⁸ and no additional order two Goldbugs less than 1×10²⁴.

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

• It was proven by Lagrange 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" (Mathematics Magazine, 66.1 (1993): 45–47). 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,^[30] and proved by Melfi in 1996:^[31] every even number is a sum of two practical numbers.

In popular culture[]

Goldbach's Conjecture (Chinese: 哥德巴赫猜想) is the title of the biography of Chinese mathematician and number theorist Chen Jingrun, written by Xu Chi.

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

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

References[]

Further reading[]

• Deshouillers, J.-M.; Effinger, G.; te Riele, H.; Zinoviev, D. (1997). "A complete Vinogradov 3-primes theorem under the Riemann hypothesis" (PDF). Electronic Research Announcements of the American Mathematical Society. 3 (15): 99–104. doi:10.1090/S1079-6762-97-00031-0.
• Montgomery, H. L.; Vaughan, R. C. (1975). "The exceptional set in Goldbach's problem" (PDF). Acta Arithmetica. 27: 353–370. doi:10.4064/aa-27-1-353-370.
• Terence Tao proved that all odd numbers are at most the sum of five primes.
• Goldbach Conjecture at MathWorld.

External links[]

• Media related to Goldbach's conjecture at Wikimedia Commons
• "Goldbach problem", Encyclopedia of Mathematics, EMS Press, 2001 [1994]
• Goldbach's original letter to Euler — PDF format (in German and Latin)
• Goldbach's conjecture, part of Chris Caldwell's Prime Pages.
• Goldbach conjecture verification, Tomás Oliveira e Silva's distributed computer search.