词条 | Prime gap | |||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||
释义 |
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)-th and the n-th prime numbers, i.e. We have g1 = 1, g2 = g3 = 2, and g4 = 4. The sequence (gn) of prime gaps has been extensively studied; however, many questions and conjectures remain unanswered. The first 60 prime gaps are: 1, 2, 2, 4, 2, 4, 2, 4, 6, 2, 6, 4, 2, 4, 6, 6, 2, 6, 4, 2, 6, 4, 6, 8, 4, 2, 4, 2, 4, 14, 4, 6, 2, 10, 2, 6, 6, 4, 6, 6, 2, 10, 2, 4, 2, 12, 12, 4, 2, 4, 6, 2, 10, 6, 6, 6, 2, 6, 4, 2, ... {{OEIS|id=A001223}}. By the definition of gn every prime can be written as Simple observationsThe first, smallest, and only odd prime gap is the gap of size 1 between 2, the only even prime number, and 3, the first odd prime. All other prime gaps are even. There is only one pair of consecutive gaps having length 2: the gaps g2 and g3 between the primes 3, 5, and 7. For any integer n, the factorial n! is the product of all positive integers up to and including n. Then in the sequence the first term is divisible by 2, the second term is divisible by 3, and so on. Thus, this is a sequence of n − 1 consecutive composite integers, and it must belong to a gap between primes having length at least n. It follows that there are gaps between primes that are arbitrarily large, that is, for any integer N, there is an integer m with {{math|gm ≥ N}}. In reality, prime gaps of n numbers can occur at numbers much smaller than n!. For instance, the first prime gap of size larger than 14 occurs between the primes 523 and 541, while 15! is the vastly larger number 1307674368000. The average gap between primes increases as the natural logarithm of the integer, and therefore the ratio of the prime gap to the integers involved decreases (and is asymptotically zero). This is a consequence of the prime number theorem. From a heuristic view, we expect the probability that the ratio of the length of the gap to the natural logarithm is greater than or equal to a fixed positive number k to be e-k; consequently the ratio can be arbitrarily large. Indeed, the ratio of the gap to the number of digits of the integers involved does increase without bound. This is a consequence of a result by Westzynthius. In the opposite direction, the twin prime conjecture asserts that {{nowrap|1=gn = 2}} for infinitely many integers n. Numerical resultsUsually the ratio of gn / ln(pn) is called the merit of the gap gn . {{As of|September 2017}}, the largest known prime gap with identified probable prime gap ends has length 6582144, with 216841-digit probable primes found by Martin Raab.[2] This gap has merit M = 13.1829. The largest known prime gap with identified proven primes as gap ends has length 1113106 and merit 25.90, with 18662-digit primes found by P. Cami, M. Jansen and J. K. Andersen.[3][4] {{As of|December 2017}}, the largest known merit value and first with merit over 40, as discovered by the Gapcoin network, is 41.93878373 with the 87-digit prime 293703234068022590158723766104419463425709075574811762098588798217895728858676728143227. The prime gap between it and the next prime is 8350.[5]
The Cramér–Shanks–Granville ratio is the ratio of gn / (ln(pn))2.[5] The greatest known value of this ratio is 0.9206386 for the prime 1693182318746371. Other record terms can be found at {{OEIS2C|id=A111943}}. We say that gn is a maximal gap, if gm < gn for all m < n. {{As of|2018|8}} the largest known maximal prime gap has length 1550, found by Bertil Nyman. It is the 80th maximal gap, and it occurs after the prime 18361375334787046697.[8] Other record (maximal) gap sizes can be found in {{OEIS2C|id=A005250}}, with the corresponding primes pn in {{OEIS2C|id=A002386}}, and the values of n in {{OEIS2C|id=A005669}}. The sequence of maximal gaps up to the nth prime is conjectured to have about terms[9] (see table below).
All maximal prime pairs are bounded. Let be the greatest Ramanujan prime less than the smaller prime of a pair of primes making up a maximal gap. Then by the Ramanujan prime corollary there is a pair of primes associated with the Ramanujan prime and , such that and . See {{OEIS2C|id=A168421}} comments. This means the gap between maximal prime pair can not more than double the prior maximal prime pair.{{cn|date=February 2019}}{{clarify|reason=The scope and order of quantifiers here is completely unclear. What is fixed first, and what depends on it?|date=February 2019}} Further resultsUpper boundsBertrand's postulate, proven in 1852, states that there is always a prime number between k and 2k, so in particular pn+1 < 2pn, which means gn < pn. The prime number theorem, proven in 1896, says that the "average length" of the gap between a prime p and the next prime is ln(p). The actual length of the gap might be much more or less than this. However, one can deduce from the prime number theorem an upper bound on the length of prime gaps: For every , there is a number such that for all . One can also deduce that the gaps get arbitrarily smaller in proportion to the primes: the quotient Hoheisel (1930) was the first to show[10] that there exists a constant θ < 1 such that hence showing that for sufficiently large n. Hoheisel obtained the possible value 32999/33000 for θ. This was improved to 249/250 by Heilbronn,[11] and to θ = 3/4 + ε, for any ε > 0, by Chudakov.[12] A major improvement is due to Ingham,[13] who showed that for some positive constant c, if then for any Here, O refers to the big O notation, ζ denotes the Riemann zeta function and π the prime-counting function. Knowing that any c > 1/6 is admissible, one obtains that θ may be any number greater than 5/8. An immediate consequence of Ingham's result is that there is always a prime number between n3 and (n + 1)3, if n is sufficiently large.[14] The Lindelöf hypothesis would imply that Ingham's formula holds for c any positive number: but even this would not be enough to imply that there is a prime number between n2 and (n + 1)2 for n sufficiently large (see Legendre's conjecture). To verify this, a stronger result such as Cramér's conjecture would be needed. Huxley in 1972 showed that one may choose θ = 7/12 = 0.58(3).[15]A result, due to Baker, Harman and Pintz in 2001, shows that θ may be taken to be 0.525.[16] In 2005, Daniel Goldston, János Pintz and Cem Yıldırım proved that and 2 years later improved this[17] to In 2013, Yitang Zhang proved that meaning that there are infinitely many gaps that do not exceed 70 million.[18] A Polymath Project collaborative effort to optimize Zhang’s bound managed to lower the bound to 4680 on July 20, 2013.[19] In November 2013, James Maynard introduced a new refinement of the GPY sieve, allowing him to reduce the bound to 600 and show that for any m there exists a bounded interval with an infinite number of translations each of which containing m prime numbers.[20] Using Maynard's ideas, the Polymath project improved the bound to 246;[19][21] assuming the Elliott–Halberstam conjecture and its generalized form, N has been reduced to 12 and 6, respectively.[19] Lower boundsIn 1931, Erik Westzynthius proved that maximal prime gaps grow more than logarithmically. That is,[22] In 1938, Robert Rankin proved the existence of a constant c > 0 such that the inequality holds for infinitely many values n, improving the results of Westzynthius and Paul Erdős. He later showed that one can take any constant c < eγ, where γ is the Euler–Mascheroni constant. The value of the constant c was improved in 1997 to any value less than 2eγ.[23] Paul Erdős offered a $10,000 prize for a proof or disproof that the constant c in the above inequality may be taken arbitrarily large.[24] This was proved to be correct in 2014 by Ford–Green–Konyagin–Tao and, independently, James Maynard.[25][26] The result was further improved to for infinitely many values of n by Ford–Green–Konyagin–Maynard–Tao.[27] Lower bounds for chains of primes have also been determined.[28] Conjectures about gaps between primesEven better results are possible under the Riemann hypothesis. Harald Cramér proved[29] that the Riemann hypothesis implies the gap gn satisfies using the big O notation. Later, he conjectured that the gaps are even smaller. Roughly speaking, Cramér's conjecture states that Firoozbakht's conjecture states that (where is the nth prime) is a strictly decreasing function of n, i.e., If this conjecture is true, then the function satisfies [30] It implies a strong form of Cramér's conjecture but is inconsistent with the heuristics of Granville and Pintz[31][32][33] which suggest that infinitely often for any where denotes the Euler–Mascheroni constant. Meanwhile, Oppermann's conjecture is weaker than Cramér's conjecture. The expected gap size with Oppermann's conjecture is on the order of As a result, under Oppermann's conjecture - there exists (probably ) for which every natural satisfies Andrica's conjecture, which is a weaker conjecture than Oppermann's, states that[34]This is a slight strengthening of Legendre's conjecture that between successive square numbers there is always a prime. Polignac's conjecture states that every positive even number k occurs as a prime gap infinitely often. The case k = 2 is the twin prime conjecture. The conjecture has not yet been proven or disproven for any specific value of k, but Zhang Yitang's result proves that it is true for at least one (currently unknown) value of k which is smaller than 70,000,000; as discussed above, this has been improved to 246. As an arithmetic functionThe gap gn between the nth and (n + 1)st prime numbers is an example of an arithmetic function. In this context it is usually denoted dn and called the prime difference function.[34] The function is neither multiplicative nor additive. {{clear}}See also{{Portal|Mathematics}}
References1. ^[https://arxiv.org/abs/cond-mat/0310148 "Hidden structure in the randomness of the prime number sequence?", S. Ares & M. Castro, 2005] 2. ^{{Cite web | url=http://trnicely.net/index.html#TPG | title=Thomas R. Nicely's Home Page}} 3. ^{{cite web|last1=Andersen|first1=Jens Kruse|title=The Top-20 Prime Gaps|url=http://primerecords.dk/primegaps/gaps20.htm|accessdate=2014-06-13}} 4. ^A proven prime gap of 1113106 5. ^1 2 NEW PRIME GAP OF MAXIMUM KNOWN MERIT 6. ^Dynamic prime gap statistics 7. ^TABLES OF PRIME GAPS 8. ^NEW MAXIMAL PRIME GAPS OF 1530 AND 1550 9. ^{{cite journal |last=Kourbatov |first=A. |title=On the nth record gap between primes in an arithmetic progression |journal=Int. Math. Forum |volume=13 |issue=2 |pages=65–78 |year=2018 |doi=10.12988/imf.2018.712103 | arxiv=1709.05508 | zbl= | jfm= |bibcode= }} 10. ^{{cite journal |first=G. |last=Hoheisel |title=Primzahlprobleme in der Analysis |journal=Sitzunsberichte der Königlich Preussischen Akademie der Wissenschaften zu Berlin |volume=33 |issue= |pages=3–11 |year=1930 | jfm=56.0172.02 }} 11. ^{{cite journal |first=H. A. |last=Heilbronn |title=Über den Primzahlsatz von Herrn Hoheisel |journal=Mathematische Zeitschrift |volume=36 |issue=1 |pages=394–423 |year=1933 |doi=10.1007/BF01188631 }} 12. ^{{cite journal |first=N. G. |last=Tchudakoff |title=On the difference between two neighboring prime numbers |journal=Math. Sb. |volume=1 |issue= |pages=799–814 |year=1936 |doi= }} 13. ^{{cite journal |last=Ingham |first=A. E. |title=On the difference between consecutive primes |journal=Quarterly Journal of Mathematics |series=Oxford Series |volume=8 |issue=1 |pages=255–266 |year=1937 |doi=10.1093/qmath/os-8.1.255 | zbl= | jfm= |bibcode=1937QJMat...8..255I }} 14. ^{{cite journal | last=Cheng | first=Yuan-You Fu-Rui | title=Explicit estimate on primes between consecutive cubes | zbl=1201.11111 | journal=Rocky Mt. J. Math. | volume=40 | pages=117–153 | year=2010 | doi=10.1216/rmj-2010-40-1-117| arxiv=0810.2113 }} 15. ^{{cite journal |last=Huxley |first=M. N. |year=1972 |title=On the Difference between Consecutive Primes |journal=Inventiones Mathematicae |volume=15 |issue=2 |pages=164–170 |doi=10.1007/BF01418933 |bibcode=1971InMat..15..164H }} 16. ^{{cite journal |last=Baker |first=R. C. |first2=G. |last2=Harman |first3=J. |last3=Pintz |year=2001 |title=The difference between consecutive primes, II |journal=Proceedings of the London Mathematical Society |volume=83 |issue=3 |pages=532–562 |doi=10.1112/plms/83.3.532 }} 17. ^{{cite arXiv|eprint=0710.2728|title=Primes in Tuples II|last1= Goldston|first1=D. A.|last2= Pintz|first2=J.|last3= Yildirim|first3=C. Y.|class=math.NT|year=2007}} 18. ^{{cite journal | title = Bounded gaps between primes | first = Yitang | last = Zhang | authorlink=Yitang Zhang | journal = Annals of Mathematics | year=2014 | volume=179 | issue=3 | pages=1121–1174 | doi=10.4007/annals.2014.179.3.7 | mr=3171761}} 19. ^1 2 {{cite web|url=http://michaelnielsen.org/polymath1/index.php?title=Bounded_gaps_between_primes|title=Bounded gaps between primes|publisher=Polymath|accessdate=2013-07-21}} 20. ^{{cite journal | title=Small gaps between primes | last=Maynard | first=James | authorlink=James Maynard (mathematician) | year=2015 | journal=Annals of Mathematics | volume=181 | issue=1 | pages=383–413 | mr=3272929 | doi=10.4007/annals.2015.181.1.7| arxiv=1311.4600 }} 21. ^{{cite journal | author=D.H.J. Polymath | title=Variants of the Selberg sieve, and bounded intervals containing many primes | journal=Research in the Mathematical Sciences | volume=1 | number=12 | doi=10.1186/s40687-014-0012-7 | arxiv=1407.4897 | year=2014 | mr=3373710}} 22. ^{{Citation |last=Westzynthius |first=E. |title=Über die Verteilung der Zahlen die zu den n ersten Primzahlen teilerfremd sind |language=de|journal=Commentationes Physico-Mathematicae Helsingsfors |volume=5 |issue= |year=1931 |pages=1–37 | zbl=0003.24601 | jfm=57.0186.02 }}. 23. ^{{cite journal |first=J. |last=Pintz |title=Very large gaps between consecutive primes |journal=J. Number Theory |volume=63 |issue=2 |pages=286–301 |year=1997 |doi=10.1006/jnth.1997.2081 }} 24. ^Erdős, Some of my favourite unsolved problems 25. ^{{cite journal | first1=Kevin | last1=Ford | first2=Ben | last2=Green | first3=Sergei | last3=Konyagin | first4=Terence | last4=Tao | year=2016 | arxiv=1408.4505 | title=Large gaps between consecutive prime numbers | journal=Ann. of Math. | volume=183 | issue=3 | pages=935–974 | doi=10.4007/annals.2016.183.3.4 | mr=3488740}} 26. ^{{cite journal | first=James | last=Maynard | year=2016 | volume=183 | issue=3 | arxiv=1408.5110 | title=Large gaps between primes | pages=915–933 | doi=10.4007/annals.2016.183.3.3 | mr = 3488739 | journal=Ann. of Math.}} 27. ^{{cite journal | arxiv=1412.5029 | title=Long gaps between primes | last1=Ford | first1=Kevin | last2=Green | first2=Ben | last3=Konyagin | first3=Sergei | last4=Maynard | first4=James | last5=Tao | first5=Terence | year=2018| mr=3718451 | journal=J. Amer. Math. Soc. | volume=31 | issue=1 | pages=65–105 | doi=10.1090/jams/876 }} 28. ^{{cite arXiv | first1=Kevin | last1=Ford | first2=James | last2=Maynard | first3=Terence | last3=Tao | title = Chains of large gaps between primes | eprint=1511.04468 | date=2015-10-13| class=math.NT }} 29. ^{{cite journal|last=Cramér |first=Harald |title=On the order of magnitude of the difference between consecutive prime numbers |url=http://matwbn.icm.edu.pl/ksiazki/aa/aa2/aa212.pdf |journal=Acta Arithmetica |volume=2 |year=1936 |pages=23–46 |doi=10.4064/aa-2-1-23-46 }} 30. ^{{cite arxiv |last=Sinha |first=Nilotpal Kanti |title=On a new property of primes that leads to a generalization of Cramer's conjecture |year=2010 |eprint=1010.1399 |class=math.NT }}. 31. ^{{cite journal |last=Granville |first=A. |title=Harald Cramér and the distribution of prime numbers |journal=Scandinavian Actuarial Journal |volume=1 |issue= |year=1995 |pages=12–28 |url=http://www.dartmouth.edu/~chance/chance_news/for_chance_news/Riemann/cramer.pdf |doi=10.1080/03461238.1995.10413946 |citeseerx=10.1.1.129.6847 }}. 32. ^{{cite journal|last=Granville |first=Andrew |title=Unexpected irregularities in the distribution of prime numbers |journal=Proceedings of the International Congress of Mathematicians |volume=1 |year=1995 |pages=388–399 |url=http://www.dms.umontreal.ca/~andrew/PDF/icm.pdf |doi=10.1007/978-3-0348-9078-6_32 |isbn=978-3-0348-9897-3 }}. 33. ^{{cite journal|last=Pintz|first=János|title=Cramér vs. Cramér: On Cramér's probabilistic model for primes|journal=Funct. Approx. Comment. Math.|volume=37|issue=2|year=2007|pages=232–471|url=http://projecteuclid.org/euclid.facm/1229619660 |doi=10.7169/facm/1229619660}} 34. ^1 Guy (2004) §A8
Further reading
External links
2 : Arithmetic functions|Prime numbers |
|||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||
随便看 |
|
开放百科全书收录14589846条英语、德语、日语等多语种百科知识,基本涵盖了大多数领域的百科知识,是一部内容自由、开放的电子版国际百科全书。