Goldbach's original conjecture (sometimes called the "ternary" goldbach conjecture), written in a june 7, 1742 letter to euler, states "at least it seems that every number that is greater than 2 is the sum of three primes" (goldbach 1742; dickson 2005, p. 421). note that goldbach considered the number 1 to be a prime, a convention that is no longer followed. as re-expressed by euler, an equivalent form of this conjecture (called the "strong" or "binary" goldbach conjecture) asserts that all positive even integers > =4 can be expressed as the sum of two primes. two primes (p, q) such that p+q=2n for n a positive integer are sometimes called a goldbach partition (oliveira e silva).

according to hardy (1999, p. 19), "it is comparatively easy to make clever guesses; indeed there are theorems, like 'goldbach's theorem,' which have never been proved and which any fool could have guessed." faber and faber offered a $1 prize to anyone who proved goldbach's conjecture between march 20, 2000 and march 20, 2002, but the prize went unclaimed and the conjecture remains open.

schnirelman (1939) proved that every even number can be written as the sum of not more than 3 primes (dunham 1990), which seems a rather far cry from a proof for two primes! pogorzelski (1977) claimed to have proven the goldbach conjecture, but his proof is not generally accepted (shanks 1985). the following table summarizes bounds n such that the strong goldbach conjecture has been shown to be true for numbers
bound reference
1×10^4 desboves 1885
1×10^5 pipping 1938
1×10^8 stein and stein 1965ab
2×10^(10) granville et al. 1989
4×10^(11) sinisalo 1993
1×10^(14) deshouillers et al. 1998
4×10^(14) richstein 1999, 2001
2×10^(16) oliveira e silva (mar. 24, 2003)
6×10^(16) oliveira e silva (oct. 3, 2003)
2×10^(17) oliveira e silva (feb. 5, 2005)
3×10^(17) oliveira e silva (dec. 30, 2005)
12×10^(17) oliveira e silva (jul. 14, 2008)
4×10^(18) oliveira e silva (apr. 2012)
the conjecture that all odd numbers > =9 are the sum of three odd primes is called the "weak" goldbach conjecture. vinogradov (1937ab, 1954) proved that every sufficiently large odd number is the sum of three primes (nagell 1951, p. 66; guy 1994), and estermann (1938) proved that almost all even numbers are the sums of two primes. vinogradov's original "sufficiently large" n> =3^(3^(15)) approx e^(e^(16.573)) approx 3.25×10^(6846168) was subsequently reduced to e^(e^(11.503)) approx 3.33×10^(43000) by chen and wang (1989). chen (1973, 1978) also showed that all sufficiently large even numbers are the sum of a prime and the product of at most two primes (guy 1994, courant and robbins 1996). more than two and a half centuries after the original conjecture was stated, the weak goldbach conjecture was proved by helfgott (2013, 2014).

a stronger version of the weak conjecture, namely that every odd number > =7 can be expressed as the sum of a prime plus twice a prime is known as levy's conjecture.

an equivalent statement of the goldbach conjecture is that for every positive integer m, there are primes p and q such that

phi(p)+phi(q)=2m,
where phi(x) is the totient function (e. g., havil 2003, p. 115; guy 2004, p. 160). (this follows immediately from phi(p)=p-1 for p prime.) erdős and moser have considered dropping the restriction that p and q be prime in this equation as a possibly easier way of determining if such numbers always exist (guy 1994, p. 105).

other variants of the goldbach conjecture include the statements that every even number > =6 is the sum of two odd primes, and every integer > 17 the sum of exactly three distinct primes.

let r(n) be the number of representations of an even number n as the sum of two primes. then the "extended" goldbach conjecture states that

r(n)∼2pi_2product_(k=2; p_k|n)(p_k-1)/(p_k-2)int_2^n(dx)/(( lnx)^2),
where pi_2 is the twin primes constant (halberstam and richert 1974).

see also: