Goldbach's weak conjecture

Goldbach's weak conjecture

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:

Every odd number greater than 7 can be expressed as the sum of three odd primes. (A prime may be used more than once in the same sum.)

This conjecture is called "weak" because if Goldbach's strong conjecture (concerning sums of two primes) is proven, it would be true. (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 useful 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, Ivan Matveevich Vinogradov eliminated 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. Vinogradov's original proof, as it used the ineffective Siegel–Walfisz theorem, did not give a bound for "sufficiently large", his 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 26,643 digits.[1]

In 1997, Deshouillers, Effinger, te Riele and Zinoviev showed[2] 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.

Leszek Kaniecki showed every odd integer is a sum of at most five primes, under Riemann Hypothesis. [3]

References

  1. ^ N. Lygeros, F. Morain, O. Rozier. http://www.lix.polytechnique.fr/~morain/Primes/myprimes.html. 
  2. ^ Deshouillers, Effinger, Te Riele and Zinoviev (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. http://www.ams.org/era/1997-03-15/S1079-6762-97-00031-0/S1079-6762-97-00031-0.pdf. 
  3. ^ Kaniecki, Leszek (1995). "On Šnirelman's constant under the Riemann hypothesis". Acta Arithmetica 4: pp. 361–374 

Wikimedia Foundation. 2010.

Игры ⚽ Нужно решить контрольную?

Look at other dictionaries:

  • Conjecture faible de Goldbach — En théorie des nombres, la conjecture faible de Goldbach, aussi connue comme la conjecture impaire de Goldbach ou le problème des trois nombres premiers, affirme que : Tout nombre impair plus grand que 7 est somme de trois nombres premiers… …   Wikipédia en Français

  • Goldbach's conjecture — is one of the oldest unsolved problems in number theory and in all of mathematics. It states::Every even integer greater than 2 can be written as the sum of two primes.Expressing a given even number as a sum of two primes is called a Goldbach… …   Wikipedia

  • Lemoine's conjecture — In number theory, Lemoine s conjecture, named after Émile Lemoine, also known as Levy s conjecture, after Hyman Levy, states that all odd integers greater than 5 can be represented as the sum of an odd prime number and an even semiprime. To put… …   Wikipedia

  • Landau's problems — At the 1912 International Congress of Mathematicians, Edmund Landau listed four basic problems about primes. These problems were characterised in his speech as unattackable at the present state of science and are now known as Landau s problems.… …   Wikipedia

  • List of mathematics articles (G) — NOTOC G G₂ G delta space G networks Gδ set G structure G test G127 G2 manifold G2 structure Gabor atom Gabor filter Gabor transform Gabor Wigner transform Gabow s algorithm Gabriel graph Gabriel s Horn Gain graph Gain group Galerkin method… …   Wikipedia

  • Timeline of number theory — A timeline of number theory.Before 1000 BC* ca. 20,000 BC Nile Valley, Ishango Bone: possibly the earliest reference to prime numbers and Egyptian multiplication.1st millennium* 250 Diophantus writes Arithmetica , one of the earliest treatises on …   Wikipedia

  • List of conjectures — This is an incomplete list of mathematical conjectures. They are divided into four sections, according to their status in 2007. See also: * Erdős conjecture, which lists conjectures of Paul Erdős and his collaborators * Unsolved problems in… …   Wikipedia

  • List of number theory topics — This is a list of number theory topics, by Wikipedia page. See also List of recreational number theory topics Topics in cryptography Contents 1 Factors 2 Fractions 3 Modular arithmetic …   Wikipedia

  • Olivier Ramaré — is a French mathematician who teaches at the Université des Sciences et Technologies de Lille. In 1995, he sharpened earlier work on Schnirelmann s theorem by proving that every even number is a sum of at most six primes. This result may be… …   Wikipedia

  • Generalized Riemann hypothesis — The Riemann hypothesis is one of the most important conjectures in mathematics. It is a statement about the zeros of the Riemann zeta function. Various geometrical and arithmetical objects can be described by so called global L functions, which… …   Wikipedia

Share the article and excerpts

Direct link
Do a right-click on the link above
and select “Copy Link”