Goldbach's weak conjecture

Last updated
Goldbach's weak conjecture
Letter Goldbach-Euler.jpg
Letter from Goldbach to Euler dated on 7 June 1742 (Latin-German) [1]
Field Number theory
Conjectured by Christian Goldbach
Conjectured in1742
First proof by Harald Helfgott
First proof in2013
Implied by Goldbach's 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

Contents

Every odd number greater than 5 can be expressed as the sum of three 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, then this would also be true. For if every even number greater than 4 is the sum of two odd primes, adding 3 to each even number greater than 4 will produce the odd numbers greater than 7 (and 7 itself is equal to 2+2+3).

In 2013, Harald Helfgott released a proof of Goldbach's weak conjecture. [2] As of 2018, the proof is widely accepted in the mathematics community, [3] but it has not yet been published in a peer-reviewed journal. The proof was accepted for publication in the Annals of Mathematics Studies series [4] in 2015, and has been undergoing further review and revision since; fully-refereed chapters in close to final form are being made public in the process. [5]

Some state the conjecture as

Every odd number greater than 7 can be expressed as the sum of three odd primes. [6]

This version excludes 7 = 2+2+3 because this requires the even prime 2. On odd numbers larger than 7 it is slightly stronger as it also excludes sums like 17 = 2+2+13, which are allowed in the other formulation. Helfgott's proof covers both versions of the conjecture. Like the other formulation, this one also immediately follows from Goldbach's strong conjecture.

Origins

The conjecture originated in correspondence between Christian Goldbach and Leonhard Euler. One formulation of the strong Goldbach conjecture, equivalent to the more common one in terms of sums of two primes, is

Every integer greater than 5 can be written as the sum of three primes.

The weak conjecture is simply this statement restricted to the case where the integer is odd (and possibly with the added requirement that the three primes in the sum be odd).

Timeline of results

In 1923, Hardy and Littlewood showed that, assuming the generalized Riemann hypothesis, the weak 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. Borozdkin (1956) derived that is large enough. [7] The integer part of this number has 4,008,660 decimal digits, so checking every number under this figure would be completely infeasible.

In 1997, Deshouillers, Effinger, te Riele and Zinoviev published a result showing [8] 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. Saouter also conducted a computer search covering the same cases at approximately the same time. [9]

Olivier Ramaré in 1995 showed that every even number n ≥ 4 is in fact the sum of at most six primes, from which it follows that every odd number n ≥ 5 is the sum of at most seven primes. Leszek Kaniecki showed every odd integer is a sum of at most five primes, under the Riemann Hypothesis. [10] In 2012, Terence Tao proved this without the Riemann Hypothesis; this improves both results. [11]

In 2002, Liu Ming-Chit (University of Hong Kong) and Wang Tian-Ze lowered Borozdkin's threshold to approximately . 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.)

In 2012 and 2013, Peruvian mathematician Harald Helfgott released a pair of papers improving major and minor arc estimates sufficiently to unconditionally prove the weak Goldbach conjecture. [12] [13] [2] [14] [15] Here, the major arcs is the union of intervals around the rationals where is a constant. Minor arcs are defined to be .

Related Research Articles

<span class="mw-page-title-main">Prime number</span> Number divisible only by 1 or itself

A prime number is a natural number greater than 1 that is not a product of two smaller natural numbers. A natural number greater than 1 that is not prime is called a composite number. For example, 5 is prime because the only ways of writing it as a product, 1 × 5 or 5 × 1, involve 5 itself. However, 4 is composite because it is a product (2 × 2) in which both numbers are smaller than 4. Primes are central in number theory because of the fundamental theorem of arithmetic: every natural number greater than 1 is either a prime itself or can be factorized as a product of primes that is unique up to their order.

<span class="mw-page-title-main">Goldbach's conjecture</span> Even integers as sums of two primes

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 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 are formally similar to the Riemann zeta-function. One can then ask the same question about the zeros of these L-functions, yielding various generalizations of the Riemann hypothesis. Many mathematicians believe these generalizations of the Riemann hypothesis to be true. The only cases of these conjectures which have been proven occur in the algebraic function field case.

<span class="mw-page-title-main">Bertrand's postulate</span> Existence of a prime number between any number and its double

In number theory, Bertrand's postulate is the theorem that for any integer , there exists at least one prime number with

<span class="mw-page-title-main">Analytic number theory</span> Exploring properties of the integers with complex analysis

In mathematics, analytic number theory is a branch of number theory that uses methods from mathematical analysis to solve problems about the integers. It is often said to have begun with Peter Gustav Lejeune Dirichlet's 1837 introduction of Dirichlet L-functions to give the first proof of Dirichlet's theorem on arithmetic progressions. It is well known for its results on prime numbers and additive number theory.

In additive number theory, the Schnirelmann density of a sequence of numbers is a way to measure how "dense" the sequence is. It is named after Russian mathematician Lev Schnirelmann, who was the first to study it.

<span class="mw-page-title-main">Mertens function</span> Summatory function of the Möbius function

In number theory, the Mertens function is defined for all positive integers n as

In mathematics, the Lindelöf hypothesis is a conjecture by Finnish mathematician Ernst Leonard Lindelöf about the rate of growth of the Riemann zeta function on the critical line. This hypothesis is implied by the Riemann hypothesis. It says that for any ε > 0,

In number theory, the Elliott–Halberstam conjecture is a conjecture about the distribution of prime numbers in arithmetic progressions. It has many applications in sieve theory. It is named for Peter D. T. A. Elliott and Heini Halberstam, who stated the conjecture in 1968.

<span class="mw-page-title-main">Olivier Ramaré</span> French mathematician

Olivier Ramaré is a French mathematician who works as Senior researcher for the CNRS. He is currently attached to Aix-Marseille Université.

In number theory, Vinogradov's theorem is a result which implies that any sufficiently large odd integer can be written as a sum of three prime numbers. It is a weaker form of Goldbach's weak conjecture, which would imply the existence of such a representation for all odd integers greater than five. It is named after Ivan Matveyevich Vinogradov, who proved it in the 1930s. Hardy and Littlewood had shown earlier that this result followed from the generalized Riemann hypothesis, and Vinogradov was able to remove this assumption. The full statement of Vinogradov's theorem gives asymptotic bounds on the number of representations of an odd integer as a sum of three primes. The notion of "sufficiently large" was ill-defined in Vinogradov's original work, but in 2002 it was shown that 101346 is sufficiently large. Additionally numbers up to 1020 had been checked via brute force methods, thus only a finite number of cases to check remained before the odd Goldbach conjecture would be proven or disproven. In 2013, Harald Helfgott proved Goldbach's weak conjecture for all cases.

<span class="mw-page-title-main">Prime gap</span> Difference between two successive prime numbers

A prime gap is the difference between two successive prime numbers. The n-th prime gap, denoted gn or g(pn) is the difference between the (n + 1)-st and the n-th prime numbers, i.e.

<span class="mw-page-title-main">Landau's problems</span> Four basic unsolved problems about prime numbers

At the 1912 International Congress of Mathematicians, Edmund Landau listed four basic problems about prime numbers. These problems were characterised in his speech as "unattackable at the present state of mathematics" and are now known as Landau's problems. They are as follows:

  1. Goldbach's conjecture: Can every even integer greater than 2 be written as the sum of two primes?
  2. Twin prime conjecture: Are there infinitely many primes p such that p + 2 is prime?
  3. Legendre's conjecture: Does there always exist at least one prime between consecutive perfect squares?
  4. Are there infinitely many primes p such that p − 1 is a perfect square? In other words: Are there infinitely many primes of the form n2 + 1?

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.

In number theory, Waring's prime number conjecture is a conjecture related to Vinogradov's theorem, named after the English mathematician Edward Waring. It states that every odd number exceeding 3 is either a prime number or the sum of three prime numbers. It follows from the generalized Riemann hypothesis, and (trivially) from Goldbach's weak conjecture.

<span class="mw-page-title-main">Riemann hypothesis</span> Conjecture on zeros of the zeta function

In mathematics, the Riemann hypothesis is the conjecture that the Riemann zeta function has its zeros only at the negative even integers and complex numbers with real part 1/2. Many consider it to be the most important unsolved problem in pure mathematics. It is of great interest in number theory because it implies results about the distribution of prime numbers. It was proposed by Bernhard Riemann (1859), after whom it is named.

A timeline of number theory.

<span class="mw-page-title-main">Jean-Marc Deshouillers</span> French mathematician

Jean-Marc Deshouillers is a French mathematician, specializing in analytic number theory. He is a professor at the University of Bordeaux.

A Proth number is a natural number N of the form where k and n are positive integers, k is odd and . A Proth prime is a Proth number that is prime. They are named after the French mathematician François Proth. The first few Proth primes are

References

  1. ↑ Correspondance mathématique et physique de quelques célèbres géomètres du XVIIIème siècle (Band 1), St.-Pétersbourg 1843, pp. 125–129.
  2. 1 2 Helfgott, Harald A. (2013). "The ternary Goldbach conjecture is true". arXiv: 1312.7748 [math.NT].
  3. ↑ "Harald Andrés Helfgott - Alexander von Humboldt-Foundation". www.humboldt-foundation.de. Archived from the original on 2022-08-24. Retrieved 2022-08-24.
  4. ↑ "Annals of Mathematics Studies". Princeton University Press. 1996-12-14. Retrieved 2023-02-05.
  5. ↑ "Harald Andrés Helfgott". webusers.imj-prg.fr. Retrieved 2021-04-06.
  6. ↑ Weisstein, Eric W. "Goldbach Conjecture". MathWorld .
  7. ↑ Helfgott, Harald Andrés (2015). "The ternary Goldbach problem". arXiv: 1501.05438 [math.NT].
  8. ↑ Deshouillers, Jean-Marc; Effinger, Gove W.; Te Riele, Herman J. J.; Zinoviev, Dmitrii (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 . MR   1469323.
  9. ↑ Yannick Saouter (1998). "Checking the odd Goldbach Conjecture up to 1020" (PDF). Math. Comp. 67 (222): 863–866. doi: 10.1090/S0025-5718-98-00928-4 . MR   1451327.
  10. ↑ Kaniecki, Leszek (1995). "On Šnirelman's constant under the Riemann hypothesis" (PDF). Acta Arithmetica . 72 (4): 361–374. doi: 10.4064/aa-72-4-361-374 . MR   1348203.
  11. ↑ Tao, Terence (2014). "Every odd number greater than 1 is the sum of at most five primes". Math. Comp. 83 (286): 997–1038. arXiv: 1201.6656 . doi:10.1090/S0025-5718-2013-02733-0. MR   3143702. S2CID   2618958.
  12. ↑ Helfgott, Harald A. (2012). "Minor arcs for Goldbach's problem". arXiv: 1205.5252 [math.NT].
  13. ↑ Helfgott, Harald A. (2013). "Major arcs for Goldbach's theorem". arXiv: 1305.2897 [math.NT].
  14. ↑ Helfgott, Harald Andres (2014). "The ternary Goldbach problem" (PDF). In Jang, Sun Young (ed.). Seoul International Congress of Mathematicians Proceedings. Vol. 2. Seoul, KOR: Kyung Moon SA. pp. 391–418. ISBN   978-89-6105-805-6. OCLC   913564239.{{cite book}}: CS1 maint: date and year (link)
  15. ↑ Helfgott, Harald A. (2015). "The ternary Goldbach problem". arXiv: 1501.05438 [math.NT].
This page is based on this Wikipedia article
Text is available under the CC BY-SA 4.0 license; additional terms may apply.
Images, videos and audio are available under their respective licenses.