# Goldbach's 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 natural number greater than 2 is the sum of two prime numbers.
The conjecture has been shown to hold for all integers less than 4×10$^{18}$ but remains unproven despite considerable effort.

## 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:
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:
   Es scheinet wenigstens, dass eine jede Zahl, die grösser ist als 2, ein aggregatum trium numerorum primorum sey. 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:
   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.

### Similar conjecture by Descartes

René Descartes wrote that "Every even number can be expressed as the sum of at most three primes." The proposition is equivalent to Goldbach's conjecture, and Paul Erdős said that "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

The strong Goldbach conjecture 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 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, which directly implies that every even number n ≥ 4 is the sum of at most 4 primes.
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$^{1⁄2+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 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. János Pintz and Imre Ruzsa found in 2020 that K = 8 works. Assuming the generalized Riemann hypothesis, K = 7 also works, as shown by Roger Heath-Brown and Jan-Christoph Schlage-Puchta in 2002.
A proof for the weak conjecture was submitted in 2013 by Harald Helfgott to Annals of Mathematics Studies series. Although the article was accepted, Helfgott decided to undertake the major modifications suggested by the referee. Despite several revisions, Helfgott's proof has not yet appeared in a peer-reviewed publication. The weak conjecture is implied by the strong conjecture, as 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 would remain unproven if Helfgott's proof is correct.

### Computational 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 = 100000. 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$^{18}$ (and double-checked up to 4×10$^{17}$) 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.

### 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.
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 actress Ella Rumpf's character Marguerite in the 2023 French-Swiss film Marguerite's Theorem.

## 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 N = p + 1 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 ⁠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 ⁠1/ln m ln(n − m)⁠. 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 ≪ √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 n = p$_1$ + ⋯ + p$_c$ with p$_1$ ≤ ⋯ ≤ p$_c$ 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 n = q$_1$ + ⋯ + q$_c$ mod p in modular arithmetic, subject to the constraints q$_1$, …, q$_c$ ≠ 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 c = 2. 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}}\geq 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 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 function is the function that 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 depend 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:
* 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". 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 states 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 not only imply Goldbach's conjecture, but also the twin prime conjecture.
* According to Bertrand's postulate, for every integer $n>1$, there is always at least one prime $p$ such that $n<p<2n.$ If the postulate were false, there would exist some integer $n$ for which no prime numbers lie between $n$ and $2n$, making it impossible to express $2n$ as a sum of two primes.
Goldbach's conjecture is used when studying computation 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 exist (which proves the conjecture true). 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.