fbpx
Wikipedia

Landau's problems

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?
Edmund Landau, German mathematician

As of October 2022, 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 & Starichkova[7] reduce this to   assuming the Generalized Riemann hypothesis for Dirichlet L-functions.

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

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.[12] Following many advances (see Pintz[13] for an overview), Pintz and Ruzsa[14] improved this to K = 8.

Twin prime conjecture

Yitang Zhang showed[15] 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.[16] Under the generalized Elliott–Halberstam conjecture this was improved to 6, extending earlier work by Maynard[17] and Goldston, Pintz & Yıldırım.[18]

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.[19] A counterexample near that size would require a prime gap a hundred million times the size of the average gap.

Heath-Brown,[20] improving on Matomäki,[21] 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.[22]

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 OEISA002496.) 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 2022, 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.[23][24] Ankeny[25] and Kubilius[26] 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 & Lewis[27] and it gives  .

Merikoski,[28] improving on previous works,[29][30][31][32][33] 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 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.

References

  1. ^ I. M. Vinogradov. Representation of an odd number as a sum of three primes, Doklady Akademii Nauk SSSR, 15 (1937), pp. 291-294.
  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. ^ Matteo Bordignon, Daniel R. Johnston, and Valeriia Starichkova, An explicit version of Chen's theorem
  6. ^ Yamada, Tomohiro (2015-11-11). "Explicit Chen's theorem". arXiv:1511.03409 [math.NT].
  7. ^ Matteo Bordignon, Valeriia Starichkova, An explicit version of Chen's theorem assuming the Generalized Riemann Hypothesis
  8. ^ 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.
  9. ^ Janos Pintz, A new explicit formula in the additive theory of primes with applications II. The exceptional set in Goldbach's problem, 2018 preprint
  10. ^ http://real.mtak.hu/124681/1/Cikk2020Rivista.pdf
  11. ^ D.A. Goldston, On Hardy and Littlewood’s contribution to the Goldbach conjecture. Proceedings of the Amalfi Conference on Analytic Number Theory (Maiori, 1989), pp. 115–155, Univ. Salerno, Salerno, 1992.
  12. ^ Yu V Linnik, Prime numbers and powers of two, Trudy Matematicheskogo Instituta imeni VA Steklova 38 (1951), pp. 152-169.
  13. ^ 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.
  14. ^ 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.
  15. ^ Yitang Zhang, Bounded gaps between primes, Annals of Mathematics 179 (2014), pp. 1121–1174 from Volume 179 (2014), Issue 3
  16. ^ 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.
  17. ^ J. Maynard (2015), Small gaps between primes. Annals of Mathematics 181(1): 383-413.
  18. ^ 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.
  19. ^ Dr. Thomas R. Nicely, First occurrence prime gaps
  20. ^ Heath-Brown, Roger (October 2020). "The Differences Between Consecutive Primes, V". International Mathematics Research Notices. 2021 (22): 17514–17562. doi:10.1093/imrn/rnz295.
  21. ^ Kaisa Matomäki (2007). "Large differences between consecutive primes". Quarterly Journal of Mathematics. 58 (4): 489–518. doi:10.1093/qmath/ham021..
  22. ^ 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.
  23. ^ Iwaniec, H. (1978). "Almost-primes represented by quadratic polynomials". Inventiones Mathematicae. 47 (2): 178–188. Bibcode:1978InMat..47..171I. doi:10.1007/BF01578070. S2CID 122656097.
  24. ^ Robert J. Lemke Oliver (2012). "Almost-primes represented by quadratic polynomials" (PDF). Acta Arithmetica. 151 (3): 241–261. doi:10.4064/aa151-3-2..
  25. ^ N. C. Ankeny, Representations of primes by quadratic forms, Amer. J. Math. 74:4 (1952), pp. 913–919.
  26. ^ J. Kubilius, On a problem in the n-dimensional analytic theory of numbers, Vilniaus Valst. Univ. Mokslo Darbai. Mat. Fiz. Chem. Mokslu Ser., 4:5–43, 1955.
  27. ^ G. Harman and P. Lewis, Gaussian primes in narrow sectors. Mathematika, 48(1-2):119–135 (2003), 2001
  28. ^ Jori Merikoski, Largest prime factor of n^2+1, J. Eur. Math. Soc. (2022), published online first. arXiv:1908.08816 [math.NT]
  29. ^ 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, S2CID 146808221
  30. ^ Jean-Marc Deshouillers and Henryk Iwaniec, On the greatest prime factor of  , Annales de l'Institut Fourier 32:4 (1982), pp. 1–11.
  31. ^ Hooley, Christopher (July 1967). "On the greatest prime factor of a quadratic polynomial". Acta Mathematica. 117: 281–299. doi:10.1007/BF02395047.
  32. ^ J. Todd (1949), "A problem on arc tangent relations", American Mathematical Monthly, 56 (8): 517–528, doi:10.2307/2305526, JSTOR 2305526
  33. ^ J. Ivanov, Uber die Primteiler der Zahlen vonder Form A+x^2, Bull. Acad. Sci. St. Petersburg 3 (1895), 361–367.

External links

landau, problems, 1912, international, congress, mathematicians, edmund, landau, listed, four, basic, problems, about, prime, numbers, these, problems, were, characterised, speech, unattackable, present, state, mathematics, known, they, follows, goldbach, conj. 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 Goldbach s conjecture Can every even integer greater than 2 be written as the sum of two primes Twin prime conjecture Are there infinitely many primes p such that p 2 is prime Legendre s conjecture Does there always exist at least one prime between consecutive perfect squares 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 Edmund Landau German mathematician As of October 2022 update all four problems are unresolved Contents 1 Progress toward solutions 1 1 Goldbach s conjecture 1 2 Twin prime conjecture 1 3 Legendre s conjecture 1 4 Near square primes 2 See also 3 Notes 4 References 5 External linksProgress toward solutions EditGoldbach s conjecture Edit 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 2 n p q displaystyle 2n p q 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 e e 34 5 4 2 10 417776432441823 displaystyle e e 34 5 approx 4 2 cdot 10 417776432441823 is the sum of a prime and a product of at most two primes Bordignon amp Starichkova 7 reduce this to e e 15 85 3 6 10 3321634 displaystyle e e 15 85 approx 3 6 cdot 10 3321634 assuming the Generalized Riemann hypothesis for Dirichlet L functions Montgomery and Vaughan showed that the exceptional set of even numbers not expressible as the sum of two primes was of density zero although the set is not proven to be finite 8 The best current bounds on the exceptional set is E x lt x 0 72 displaystyle E x lt x 0 72 for large enough x due to Pintz 9 10 and E x x 0 5 log 3 x displaystyle E x ll x 0 5 log 3 x under RH due to Goldston 11 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 12 Following many advances see Pintz 13 for an overview Pintz and Ruzsa 14 improved this to K 8 Twin prime conjecture Edit Yitang Zhang showed 15 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 16 Under the generalized Elliott Halberstam conjecture this was improved to 6 extending earlier work by Maynard 17 and Goldston Pintz amp Yildirim 18 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 Edit It suffices to check that each prime gap starting at p is smaller than 2 p displaystyle 2 sqrt p A table of maximal prime gaps shows that the conjecture holds to 264 1 8 1019 19 A counterexample near that size would require a prime gap a hundred million times the size of the average gap Heath Brown 20 improving on Matomaki 21 shows that there are at most x 1 10 e displaystyle x 1 10 varepsilon exceptional primes followed by gaps larger than 2 p displaystyle sqrt 2p in particular p n x p n 1 p n gt p n 1 2 p n 1 p n x 3 5 e displaystyle sum stackrel p n 1 p n gt sqrt p n 1 2 p n leq x p n 1 p n ll x 3 5 varepsilon A result due to Ingham shows that there is a prime between n 3 displaystyle n 3 and n 1 3 displaystyle n 1 3 for every large enough n 22 Near square primes Edit Landau s fourth problem asked whether there are infinitely many primes which are of the form p n 2 1 displaystyle p n 2 1 for integer n The list of known primes of this form is OEIS 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 2022 update 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 n 2 1 displaystyle n 2 1 with at most two prime factors 23 24 Ankeny 25 and Kubilius 26 proved that assuming the extended Riemann hypothesis for L functions on Hecke characters there are infinitely many primes of the form p x 2 y 2 displaystyle p x 2 y 2 with y O log p displaystyle y O log p Landau s conjecture is for the stronger y 1 displaystyle y 1 The best unconditional result is due to Harman amp Lewis 27 and it gives y O p 0 119 displaystyle y O p 0 119 Merikoski 28 improving on previous works 29 30 31 32 33 showed that there are infinitely many numbers of the form n 2 1 displaystyle n 2 1 with greatest prime factor at least n 1 279 displaystyle n 1 279 note 2 Replacing the exponent with 2 would yield Landau s conjecture The Brun sieve establishes an upper bound on the density of primes having the form p n 2 1 displaystyle p n 2 1 there are O x log x displaystyle O sqrt x log x such primes up to x displaystyle x Hence almost all numbers of the form n 2 1 displaystyle n 2 1 are composite See also EditList of unsolved problems in mathematics Hilbert s problemsNotes Edit A semiprime is a natural number that is the product of two prime factors Merikoski gives two conjectures which would improve the exponent to 1 286 or 1 312 respectively References Edit I M Vinogradov Representation of an odd number as a sum of three primes Doklady Akademii Nauk SSSR 15 1937 pp 291 294 Helfgott H A 2013 Major arcs for Goldbach s theorem arXiv 1305 2897 math NT Helfgott H A 2012 Minor arcs for Goldbach s problem arXiv 1205 5252 math NT Helfgott H A 2013 The ternary Goldbach conjecture is true arXiv 1312 7748 math NT Matteo Bordignon Daniel R Johnston and Valeriia Starichkova An explicit version of Chen s theorem Yamada Tomohiro 2015 11 11 Explicit Chen s theorem arXiv 1511 03409 math NT Matteo Bordignon Valeriia Starichkova An explicit version of Chen s theorem assuming the Generalized Riemann Hypothesis 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 Janos Pintz A new explicit formula in the additive theory of primes with applications II The exceptional set in Goldbach s problem 2018 preprint http real mtak hu 124681 1 Cikk2020Rivista pdf D A Goldston On Hardy and Littlewood s contribution to the Goldbach conjecture Proceedings of the Amalfi Conference on Analytic Number Theory Maiori 1989 pp 115 155 Univ Salerno Salerno 1992 Yu V Linnik Prime numbers and powers of two Trudy Matematicheskogo Instituta imeni VA Steklova 38 1951 pp 152 169 Janos 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 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 Yitang Zhang Bounded gaps between primes Annals of Mathematics 179 2014 pp 1121 1174 from Volume 179 2014 Issue 3 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 J Maynard 2015 Small gaps between primes Annals of Mathematics 181 1 383 413 Alan Goldston Daniel Motohashi Yoichi Pintz Janos Yalcin Yildirim 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 Dr Thomas R Nicely First occurrence prime gaps Heath Brown Roger October 2020 The Differences Between Consecutive Primes V International Mathematics Research Notices 2021 22 17514 17562 doi 10 1093 imrn rnz295 Kaisa Matomaki 2007 Large differences between consecutive primes Quarterly Journal of Mathematics 58 4 489 518 doi 10 1093 qmath ham021 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 Iwaniec H 1978 Almost primes represented by quadratic polynomials Inventiones Mathematicae 47 2 178 188 Bibcode 1978InMat 47 171I doi 10 1007 BF01578070 S2CID 122656097 Robert J Lemke Oliver 2012 Almost primes represented by quadratic polynomials PDF Acta Arithmetica 151 3 241 261 doi 10 4064 aa151 3 2 N C Ankeny Representations of primes by quadratic forms Amer J Math 74 4 1952 pp 913 919 J Kubilius On a problem in the n dimensional analytic theory of numbers Vilniaus Valst Univ Mokslo Darbai Mat Fiz Chem Mokslu Ser 4 5 43 1955 G Harman and P Lewis Gaussian primes in narrow sectors Mathematika 48 1 2 119 135 2003 2001 Jori Merikoski Largest prime factor of n 2 1 J Eur Math Soc 2022 published online first arXiv 1908 08816 math NT de la Breteche Regis Drappeau Sary 2020 Niveau de repartition des polynomes 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 S2CID 146808221 Jean Marc Deshouillers and Henryk Iwaniec On the greatest prime factor of n 2 1 displaystyle n 2 1 Annales de l Institut Fourier 32 4 1982 pp 1 11 Hooley Christopher July 1967 On the greatest prime factor of a quadratic polynomial Acta Mathematica 117 281 299 doi 10 1007 BF02395047 J Todd 1949 A problem on arc tangent relations American Mathematical Monthly 56 8 517 528 doi 10 2307 2305526 JSTOR 2305526 J Ivanov Uber die Primteiler der Zahlen vonder Form A x 2 Bull Acad Sci St Petersburg 3 1895 361 367 External links EditWeisstein Eric W Landau s Problems MathWorld Retrieved from https en wikipedia org w index php title Landau 27s problems amp oldid 1129255968, wikipedia, wiki, book, books, library,

article

, read, download, free, free download, mp3, video, mp4, 3gp, jpg, jpeg, gif, png, picture, music, song, movie, book, game, games.