On a conjecture of Erdős, Pólya and Turán on consecutive gaps between primes
From MaRDI portal
(Redirected from Publication:722382)
Abstract: Let p_n denote the sequence of all primes and let d_n=p_n-p_{n-1} denote the sequence of all gaps between consecutive primes. In 1948 ErdH{o}s and Tur'an showed that d_{n+1}-d_n changes sign infinitely often and together with P'olya asked for a necessary and sufficient condition that a fixed linear combination of r>1 consecutive prime gaps d_{n+i} i=(1,2,...r) should change sign infinitely often as n runs through the sequence of all natural numbers. They conjectured that the condition is that the non zero values among the coefficients of the linear combination cannot all have the same sign but they could prove only much weaker relations. In the present work this conjecture is proved by the aid of the Maynard-Tao method and other important ideas of the recent work of W.D. Banks, T. Freiberg and J.Maynard (see arXiv:1404.59094v2).
Recommendations
Cites work
- On limit points of the sequence of normalized prime gaps
- On some new questions on the distribution of prime numbers
- On the difference of consecutive primes
- Paul Erdős and the difference of primes
- Primes in tuples. II
- Small gaps between primes
- Variants of the Selberg sieve, and bounded intervals containing many primes
Cited in
(5)- Golomb’s Conjecture on Prime Gaps
- The Bounded Gap Conjecture and bounds between consecutive Goldbach numbers
- Prime gaps and the Firoozbakht conjecture
- scientific article; zbMATH DE number 1949161 (Why is no real title available?)
- Polignac numbers, conjectures of Erdős on gaps between primes, arithmetic progressions in primes, and the bounded gap conjecture
This page was built for publication: On a conjecture of Erdős, Pólya and Turán on consecutive gaps between primes
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q722382)
