Research notes on every problem, and a library of the papers behind them. Built from the open erdos repository.
Updated
Statement
Runs of consecutive prime gaps are as defined on p. 2: for and some natural number , where is the -th smallest prime (see Corollary 1).
Corollary 2 (p. 3). For every there are infinitely many runs of consecutive prime gaps with for , and infinitely many with for .
The stronger runs (p. 3, the paragraph after Corollary 2; built in the proof on pp. 4-5). The proof gives infinitely many runs with for , and infinitely many with for .
Proof pointer
Pp. 4-5. Take and , and set , , and, for , . Consecutive differences of this sequence each divide every later one (the paper's (5)), and is admissible because divides every . Theorem 1 with primes gives gaps ; the product of the earlier gaps divides the product of all differences with , which is , and by (5) that divides . The reversed runs come from .
Read depth
Claims checked: Corollary 2 and the stronger runs were read clause by clause on the page images of the arXiv print, and the proof on pp. 4-5 was followed. It rests on Theorem 1 and through it on the Maynard-Tao theorem, which the paper cites. Nothing here is independently reviewed.
Dependencies
- Theorem 1 of this paper, applied with primes.
Source. W. D. Banks, T. Freiberg and C. L. Turnage-Butterbaugh, Consecutive primes in tuples, Acta Arith. 167 (2015), no. 3, 261-266, doi:10.4064/aa167-3-4, arXiv:1311.7003; the edition read and its page numbering are named on the source card.
Bears on
No Erdős problem in the corpus is recorded as concerning this corollary.