Goldbach's weak conjecture

related topics
{math, number, function}
{school, student, university}

In number theory, Goldbach's weak conjecture, also known as the odd Goldbach conjecture, the ternary Goldbach problem, or the 3-primes problem, states that:

This conjecture is called "weak" because Goldbach's strong conjecture concerning sums of two primes, if proven, would establish Goldbach's weak conjecture. (Since if every even number greater than 4 is the sum of two odd primes, merely adding 3 to each even number greater than 4 will produce the odd numbers greater than 7.)

The conjecture has not yet been proven, but there have been some helpful near misses. In 1923, Hardy and Littlewood showed that, assuming the generalized Riemann hypothesis, the odd Goldbach conjecture is true for all sufficiently large odd numbers. In 1937, a Russian mathematician, Ivan Matveevich Vinogradov, was able to eliminate the dependency on the generalised Riemann hypothesis and proved directly (see Vinogradov's theorem) that all sufficiently large odd numbers can be expressed as the sum of three primes. Although Vinogradov himself was unable to specify "sufficiently large" numerically, his own student K. Borozdin proved, in 1939, that 314348907 is large enough. This number has 6,846,169 decimal digits, so checking every number under this figure would be highly infeasible with current technology.

In 2002, Liu Ming-Chit (University of Hong Kong) and Wang Tian-Ze lowered this threshold to approximately n>e^{3100}\approx 2 \times 10^{1346}. The exponent is still much too large to admit checking all smaller numbers by computer. (Computer searches have only reached as far as 1018 for the strong Goldbach conjecture, and not much further than that for the weak Goldbach conjecture.) However, this bound is small enough that any single odd number below the bound can be verified by existing primality tests such as elliptic curve primality proving, which generates a proof of primality and has been used on numbers with as many as 20,562 digits.

In 1997, Deshouillers, Effinger, te Riele and Zinoviev showed[1] that the generalized Riemann hypothesis implies Goldbach's weak conjecture for all numbers. This result combines a general statement valid for numbers greater than 1020 with an extensive computer search of the small cases.

References

Full article ▸

related documents
Topological ring
Kernel (category theory)
Twin prime conjecture
Amicable number
Separated sets
Ordered field
Metrization theorem
Logarithmic integral function
Magma (algebra)
Heaviside step function
CLU (programming language)
Graded algebra
Lipschitz continuity
Bézout's identity
Polynomial time
Regular language
Greedy algorithm
Complement (set theory)
Logical disjunction
Binary function
Divisor
Intersection (set theory)
Lagrange's theorem (group theory)
NP-hard
Simple LR parser
Euler's criterion
Chomsky normal form
BPP
Decision problem
Whittaker–Shannon interpolation formula