Landau's problems

Last updated
Edmund Landau, German mathematician Edmund Landau.jpg
Edmund Landau, German mathematician

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:

Contents

  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?

As of 2024, all four problems are unresolved.

Progress toward solutions

Goldbach's conjecture

Goldbach's weak conjecture, every odd number greater than 5 can be expressed as the sum of three primes, is a consequence of Goldbach's conjecture. Ivan Vinogradov proved it for large enough n (Vinogradov's theorem) in 1937, [1] and Harald Helfgott extended this to a full proof of Goldbach's weak conjecture in 2013. [2] [3] [4]

Chen's theorem, another weakening of Goldbach's conjecture, proves that for all sufficiently large n, where p is prime and q is either prime or semiprime. [note 1] Bordignon, Johnston, and Starichkova, [5] correcting and improving on Yamada, [6] proved an explicit version of Chen's theorem: every even number greater than is the sum of a prime and a product of at most two primes. Bordignon and Starichkova [7] reduce this to assuming the Generalized Riemann hypothesis (GRH) for Dirichlet L-functions. Johnson and Starichkova give a version working for all n≥ 4 at the cost of using a number which is the product of at most 369 primes rather than a prime or semiprime; under GRH they improve 369 to 33. [8]

Montgomery and Vaughan showed that the exceptional set of even numbers not expressible as the sum of two primes has a density zero, although the set is not proven to be finite. [9] The best current bounds on the exceptional set is (for large enough x) due to Pintz, [10] [11] and under RH, due to Goldston. [12]

Linnik proved that large enough even numbers could be expressed as the sum of two primes and some (ineffective) constant K of powers of 2. [13] Following many advances (see Pintz [14] for an overview), Pintz and Ruzsa [15] improved this to K = 8. Assuming the GRH, this can be improved to K = 7. [16]

Twin prime conjecture

Yitang Zhang showed [17] that there are infinitely many prime pairs with gap bounded by 70 million, and this result has been improved to gaps of length 246 by a collaborative effort of the Polymath Project. [18] Under the generalized Elliott–Halberstam conjecture this was improved to 6, extending earlier work by Maynard [19] and Goldston, Pintz and Yıldırım. [20]

Chen showed that there are infinitely many primes p (later called Chen primes) such that p + 2 is either a prime or a semiprime.

Legendre's conjecture

It suffices to check that each prime gap starting at p is smaller than . A table of maximal prime gaps shows that the conjecture holds to 264 ≈ 1.8×1019. [21] A counterexample near that size would require a prime gap a hundred million times the size of the average gap.

Järviniemi, [22] improving on Heath-Brown [23] and Matomäki, [24] shows that there are at most exceptional primes followed by gaps larger than ; in particular,

A result due to Ingham shows that there is a prime between and for every large enough n. [25]

Near-square primes

Landau's fourth problem asked whether there are infinitely many primes which are of the form for integer n. (The list of known primes of this form is A002496.) The existence of infinitely many such primes would follow as a consequence of other number-theoretic conjectures such as the Bunyakovsky conjecture and Bateman–Horn conjecture. As of 2024, this problem is open.

One example of near-square primes are Fermat primes. Henryk Iwaniec showed that there are infinitely many numbers of the form with at most two prime factors. [26] [27] Ankeny [28] and Kubilius [29] proved that, assuming the extended Riemann hypothesis for L-functions on Hecke characters, there are infinitely many primes of the form with . Landau's conjecture is for the stronger . The best unconditional result is due to Harman and Lewis [30] and it gives .

Merikoski, [31] improving on previous works, [32] [33] [34] [35] [36] showed that there are infinitely many numbers of the form with greatest prime factor at least . [note 2] Replacing the exponent with 2 would yield Landau's conjecture.

The Friedlander–Iwaniec theorem shows that infinitely many primes are of the form . [37]

Baier and Zhao [38] prove that there are infinitely many primes of the form with ; the exponent can be improved to under the Generalized Riemann Hypothesis for L-functions and to under a certain Elliott-Halberstam type hypothesis.

The Brun sieve establishes an upper bound on the density of primes having the form : there are such primes up to . Hence almost all numbers of the form are composite.

See also

Notes

  1. ↑ A semiprime is a natural number that is the product of two prime factors.
  2. ↑ Merikoski gives two conjectures which would improve the exponent to 1.286 or 1.312, respectively.

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.

A twin prime is a prime number that is either 2 less or 2 more than another prime number—for example, either member of the twin prime pair or (41, 43). In other words, a twin prime is a prime that has a prime gap of two. Sometimes the term twin prime is used for a pair of twin primes; an alternative name for this is prime twin or prime pair.

<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.

<span class="mw-page-title-main">Goldbach's weak conjecture</span> Solved conjecture about prime numbers

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

<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.

In mathematics, Schinzel's hypothesis H is one of the most famous open problems in the topic of number theory. It is a very broad generalization of widely open conjectures such as the twin prime conjecture. The hypothesis is named after Andrzej Schinzel.

Sieve theory is a set of general techniques in number theory, designed to count, or more realistically to estimate the size of, sifted sets of integers. The prototypical example of a sifted set is the set of prime numbers up to some prescribed limit X. Correspondingly, the prototypical example of a sieve is the sieve of Eratosthenes, or the more general Legendre sieve. The direct attack on prime numbers using these methods soon reaches apparently insuperable obstacles, in the way of the accumulation of error terms. In one of the major strands of number theory in the twentieth century, ways were found of avoiding some of the difficulties of a frontal attack with a naive idea of what sieving should be.

<span class="mw-page-title-main">Chen's theorem</span> Every large even number is either sum of a prime and a semi-prime or two primes

In number theory, Chen's theorem states that every sufficiently large even number can be written as the sum of either two primes, or a prime and a semiprime.

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 a specific version of the conjecture in 1968.

Legendre's conjecture, proposed by Adrien-Marie Legendre, states that there is a prime number between and for every positive integer . The conjecture is one of Landau's problems (1912) on prime numbers, and is one of many open problems on the spacing of prime numbers.

<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.

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, the parity problem refers to a limitation in sieve theory that prevents sieves from giving good estimates in many kinds of prime-counting problems. The problem was identified and named by Atle Selberg in 1949. Beginning around 1996, John Friedlander and Henryk Iwaniec developed some parity-sensitive sieves that make the parity problem less of an obstacle.

<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, after whom it is named.

János Pintz is a Hungarian mathematician working in analytic number theory. He is a fellow of the Rényi Mathematical Institute and is also a member of the Hungarian Academy of Sciences. In 2014, he received the Cole Prize of the American Mathematical Society.

<span class="mw-page-title-main">Firoozbakht's conjecture</span> Bound on the gaps between prime numbers

In number theory, Firoozbakht's conjecture is a conjecture about the distribution of prime numbers. It is named after the Iranian mathematician Farideh Firoozbakht who stated it in 1982.

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. ↑ Vinogradow, I. M. (November 2002). "Representation of an odd number as a sum of three primes". The Goldbach Conjecture. Series in Pure Mathematics. Vol. 4. World Scientific. pp. 61–64. doi:10.1142/9789812776600_0003. ISBN   978-981-238-159-0.
  2. ↑ Helfgott, H.A. (2013). "Major arcs for Goldbach's theorem". arXiv: 1305.2897 [math.NT].
  3. ↑ Helfgott, H.A. (2012). "Minor arcs for Goldbach's problem". arXiv: 1205.5252 [math.NT].
  4. ↑ Helfgott, H.A. (2013). "The ternary Goldbach conjecture is true". arXiv: 1312.7748 [math.NT].
  5. ↑ Bordignon, Matteo; Johnston, Daniel R.; Starichkova, Valeriia (2022). "An explicit version of Chen's theorem". arXiv: 2207.09452 .
  6. ↑ Yamada, Tomohiro (2015-11-11). "Explicit Chen's theorem". arXiv: 1511.03409 [math.NT].
  7. ↑ Bordignon, Matteo; Starichkova, Valeriia (2022). "An explicit version of Chen's theorem assuming the Generalized Riemann Hypothesis". arXiv: 2211.08844 .
  8. ↑ Johnston, Daniel R.; Starichkova, Valeriia V. (2022). "Some explicit results on the sum of a prime and an almost prime". arXiv: 2208.01229 .
  9. ↑ Montgomery, H. L.; Vaughan, R. C. (1975). "The exceptional set in Goldbach's problem" (PDF). Acta Arithmetica. 27: 353–370. doi: 10.4064/aa-27-1-353-370 .
  10. ↑ Pintz, Janos (2018). "A new explicit formula in the additive theory of primes with applications II. The exceptional set in Goldbach's problem". arXiv: 1804.09084 .
  11. ↑ Pintz, János. "An Approximate Formula for Goldbach's Problem with Applications" (PDF). mtak.hu.
  12. ↑ Goldston, D.A. (1992). On Hardy and Littlewood's contribution to the Goldbach conjecture. Proceedings of the Amalfi Conference on Analytic Number Theory (Maiori, 1989). Università di Salerno. pp. 115–155.
  13. ↑ Yu V Linnik, Prime numbers and powers of two, Trudy Matematicheskogo Instituta imeni VA Steklova38 (1951), pp. 152-169.
  14. ↑ János Pintz, Approximations to the Goldbach and twin prime problem and gaps between consecutive primes, Probability and Number Theory (Kanazawa, 2005), Advanced Studies in Pure Mathematics 49, pp. 323–365. Math. Soc. Japan, Tokyo, 2007.
  15. ↑ Pintz, J.; Ruzsa, I. Z. (July 2020). "On Linnik's approximation to Goldbach's problem. II" (PDF). Acta Mathematica Hungarica . 161 (2): 569–582. doi:10.1007/s10474-020-01077-8. S2CID   225457520.
  16. ↑ Heath-Brown, D.R.; Puchta, J.-C. (2002). "Integers Represented as a Sum of Primes and Powers of Two". arXiv: math/0201299 .
  17. ↑ Zhang, Yitang (May 2014). "Bounded gaps between primes". Annals of Mathematics. 179 (3): 1121–1174. doi:10.4007/annals.2014.179.3.7. ISSN   0003-486X.
  18. ↑ D.H.J. Polymath (2014). "Variants of the Selberg sieve, and bounded intervals containing many primes". Research in the Mathematical Sciences. 1 (12): 12. arXiv: 1407.4897 . doi: 10.1186/s40687-014-0012-7 . MR   3373710. S2CID   119699189.
  19. ↑ James, Maynard (2013). "Small gaps between primes". arXiv: 1311.4600 .
  20. ↑ Alan Goldston, Daniel; Motohashi, Yoichi; Pintz, János; Yalçın Yıldırım, Cem (2006). "Small Gaps between Primes Exist". Proceedings of the Japan Academy, Series A. 82 (4): 61–65. arXiv: math/0505300 . doi:10.3792/pjaa.82.61. S2CID   18847478.
  21. ↑ Nicely, Thomas R. "First occurrence prime gaps". University of Lynchburg . Retrieved 2024-09-11.
  22. ↑ Järviniemi, Olli (2022). "On large differences between consecutive primes". arXiv: 2212.10965 .
  23. ↑ Heath-Brown, Roger (October 2020). "The Differences Between Consecutive Primes, V". International Mathematics Research Notices. 2021 (22): 17514–17562. arXiv: 1906.09555 . doi: 10.1093/imrn/rnz295 .
  24. ↑ Matomaki, K. (2007). "Large differences between consecutive primes". The Quarterly Journal of Mathematics. 58 (4): 489–518. doi:10.1093/qmath/ham021. ISSN   0033-5606..
  25. ↑ Ingham, A. E. (1937). "On the difference between consecutive primes". Quarterly Journal of Mathematics. 8 (1): 255–266. Bibcode:1937QJMat...8..255I. doi:10.1093/qmath/os-8.1.255.
  26. ↑ Iwaniec, Henryk (1978). "Almost-primes represented by quadratic polynomials". Inventiones Mathematicae. 47 (2): 171–188. Bibcode:1978InMat..47..171I. doi:10.1007/BF01578070. ISSN   0020-9910. S2CID   122656097.
  27. ↑ Lemke Oliver, Robert J. (2012). "Almost-primes represented by quadratic polynomials" (PDF). Acta Arithmetica. 151 (3): 241–261. doi:10.4064/aa151-3-2. ISSN   0065-1036.
  28. ↑ Ankeny, N. C. (October 1952). "Representations of Primes by Quadratic Forms". American Journal of Mathematics . 74 (4): 913–919. doi:10.2307/2372233. JSTOR   2372233.
  29. ↑ Kubilius, J.P. (1955). "On a problem in the n-dimensional analytic theory of numbers". Viliniaus Valst. Univ. Mokslo dardai Chem. Moksly, Ser. 4: 5–43.
  30. ↑ Harman, G.; Lewis, P. (2001). "Gaussian primes in narrow sectors". Mathematika . 48 (1–2): 119–135. doi:10.1112/S0025579300014388. S2CID   119730332.
  31. ↑ Merikoski, Jori (2022). "Largest prime factor of ". Journal of the European Mathematical Society. 25 (4): 1253–1284. arXiv: 1908.08816 . doi: 10.4171/jems/1216 . ISSN   1435-9855.
  32. ↑ de la Bretèche, Régis; Drappeau, Sary (2020). "Niveau de répartition des polynômes quadratiques et crible majorant pour les entiers friables". Journal of the European Mathematical Society . 22 (5): 1577–1624. arXiv: 1703.03197 . doi:10.4171/jems/951. ISSN   1435-9855. S2CID   146808221.
  33. ↑ Jean-Marc Deshouillers and Henryk Iwaniec, On the greatest prime factor of , Annales de l'Institut Fourier32:4 (1982), pp. 1–11.
  34. ↑ Hooley, Christopher (July 1967). "On the greatest prime factor of a quadratic polynomial". Acta Mathematica. 117: 281–299. doi: 10.1007/BF02395047 .
  35. ↑ Todd, John (1949). "A Problem on Arc Tangent Relations". The American Mathematical Monthly. 56 (8): 517–528. doi:10.2307/2305526. JSTOR   2305526.
  36. ↑ J. Ivanov, Uber die Primteiler der Zahlen vonder Form A+x^2, Bull. Acad. Sci. St. Petersburg 3 (1895), 361–367.
  37. ↑ Friedlander, John; Iwaniec, Henryk (1997). "Using a parity-sensitive sieve to count prime values of a polynomial". Proceedings of the National Academy of Sciences. 94 (4): 1054–1058. Bibcode:1997PNAS...94.1054F. doi: 10.1073/pnas.94.4.1054 . ISSN   0027-8424. PMC   19742 . PMID   11038598..
  38. ↑ Baier, Stephan; Zhao, Liangyi (2006). "Bombieri–Vinogradov type theorems for sparse sets of moduli". Acta Arithmetica. 125 (2): 187–201. arXiv: math/0602116 . Bibcode:2006AcAri.125..187B. doi:10.4064/aa125-2-5. ISSN   0065-1036.
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.