Goldbach's conjecture is one of the oldest unsolved problems in number theory and in all of mathematics. It states:
Expressing a given even number as a sum of two primes is called a Goldbach partition of the number. For example,
Contents 
On 7 June, 1742, the Prussian mathematician Christian Goldbach wrote a letter to Leonhard Euler (letter XLIII)^{[3]} in which he proposed the following conjecture:
He then proposed a second conjecture in the margin of his letter:
He considered 1 to be a prime number, a convention subsequently abandoned.^{[4]} The two conjectures are now known to be equivalent, but this didn't seem to be an issue at the time. A modern version of Goldbach's marginal conjecture is:
Euler replied in a letter dated 30 June, 1742, and reminded Goldbach of an earlier conversation they had ("...so Ew vormals mit mir communicirt haben.."), in which Goldbach remarked his original (and not marginal) conjecture followed from the following statement
which is thus also a conjecture of Goldbach, 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 necht demonstriren kann.” ("every even integer is a sum of two primes. I regard this as a completely certain theorem, although I cannot prove it.")^{[5]}^{[6]}
Goldbach's third version (equivalent to the two other versions) is the form in which the conjecture is usually expressed today. It is also known as the "strong", "even", or "binary" Goldbach conjecture, to distinguish it from a weaker corollary. The strong Goldbach conjecture implies the conjecture that all odd numbers greater than 7 are the sum of three odd primes, which is known today variously as the "weak" Goldbach conjecture, the "odd" Goldbach conjecture, or the "ternary" Goldbach conjecture. Both questions have remained unsolved ever since, although the weak form of the conjecture appears to be much closer to resolution than the strong one. If the strong Goldbach conjecture is true, the weak Goldbach conjecture will be true by implication.^{[6]}
For small values of n, the strong Goldbach conjecture (and hence the weak Goldbach conjecture) can be verified directly. For instance, N. Pipping in 1938 laboriously verified the conjecture up to n ≤ 10^{5} ^{[7]}. With the advent of computers, many more small values of n have been checked; T. Oliveira e Silva is running a distributed computer search that has verified the conjecture for n ≤ 1.609*10^{18} and some higher small ranges up to 4*10^{18} (double checked up to 1*10^{17}).^{[8]}
Statistical considerations which 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 n/2, then one might expect the probability of m and nm simultaneously being prime to be . This heuristic is nonrigorous for a number of reasons; for instance, it assumes that the events that m and n − m are prime are statistically independent of each other. Nevertheless, 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
Since this quantity goes to infinity as n increases, we expect that every large even integer has not just one representation as the sum of two primes, but in fact has very many such representations.
The above heuristic argument is actually somewhat inaccurate, because it ignores some dependence between the events of m and n − m being prime. For instance, if m is odd then n − m is also odd, and if m is even, then n − m is even, a nontrivial relation because (besides 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, Hardy and Littlewood in 1923 conjectured (as part of their famous HardyLittlewood 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 should be asymptotically equal to
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 . This formula has been rigorously proven to be asymptotically valid for c ≥ 3 from the work of 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
when n is even, where Π_{2} is the twin prime constant
This asymptotic 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 informatively illustrate the above equations. See Goldbach's comet^{[9]}.
Considerable work has been done on the weak Goldbach conjecture.
The strong Goldbach conjecture is much more difficult. Using the method of Vinogradov, Chudakov,^{[10]} van der Corput,^{[11]} and Estermann^{[12]} 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 every even number n ≥ 4 can be written as the sum of at most 20 primes. This result was subsequently improved by many authors; currently, the best known result is due to Olivier Ramaré, who in 1995 showed that every even number n ≥ 4 is in fact the sum of at most six primes. In fact, resolving the weak Goldbach conjecture will also directly imply that every even number n ≥ 4 is the sum of at most four primes.
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)^{[13]}—e.g., 100 = 23 + 7·11.
In 1975, Hugh Montgomery and Robert Charles Vaughan showed that "most" even numbers were expressible as the sum of two primes. More precisely, they showed that there existed 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 which are not the sum of two primes has density zero.
Linnik proved in 1951 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 HeathBrown and JanChristoph SchlagePuchta in 2002 found that K=13 works.^{[14]} This was improved to K=8 by Pintz and Ruzsa.^{[15]}
One can pose similar questions when primes are replaced by other special sets of numbers, such as the squares. For instance, 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.
As with many famous conjectures in mathematics, there are a number of purported proofs of the Goldbach conjecture, none of which are currently accepted by the mathematical community.
Goldbach's conjecture is one of the oldest unsolved problems in number theory and in all of mathematics. It states:
On 7 June, 1742, the Prussian mathematician Christian Goldbach wrote a letter to Leonhard Euler (letter XLIII) [1] in which he proposed the following conjecture:
He considered 1 to be a prime number, a convention subsequently abandoned. A modern version of Goldbach's original conjecture is:
Euler, becoming interested in the problem, answered by noting that this conjecture would follow from a stronger version,
adding that he regarded this a fully certain theorem ("ein ganz gewisses Theorema"), in spite of his being unable to prove it.
