Research notes on every problem, and a library of the papers behind them. Built from the open erdos repository.
Updated
Statement
Setting (p. 1). A -tuple of linear forms in is admissible when the polynomial has no fixed prime divisor, that is, for every prime the number of residues at which it vanishes mod is less than . The paper considers only tuples with and , its condition (1).
The input (p. 1) is the Maynard-Tao theorem in Granville's formulation, which the paper quotes and does not prove: for every with there is , depending only on , such that for every integer and every admissible satisfying (1), the set contains primes for infinitely many ; one may take any with .
Theorem 1 (p. 2). Let with and , as in the Maynard-Tao theorem. Let be distinct integers with admissible, and let be a positive integer coprime to . Then there is a subset such that, for infinitely many , the numbers are consecutive primes.
The paper notes (p. 2) that the case , , with the weaker bound , was proved earlier by Pintz by a different argument.
Proof pointer
Pp. 3-4. After shifting so that , each integer in that is not a is assigned its own prime , coprime to and with for every ; the Chinese remainder theorem gives with for all such . With , the tuple is admissible and satisfies (1), and every prime in is one of its values. Taking the largest such that some of these forms are simultaneously prime for infinitely many , the Maynard-Tao theorem gives , and maximality forces the remaining forms to be composite for all large such , so those primes are consecutive.
Read depth
Claims checked: the definitions, the quoted Maynard-Tao statement and Theorem 1 were read clause by clause on the page images of the arXiv print, and the proof on pp. 3-4 was followed. The Maynard-Tao theorem is cited, not proved, in the paper and was not checked here. Nothing here is independently reviewed.
Dependencies
None in the corpus. External input: the Maynard-Tao theorem (Maynard, Small gaps between primes, Ann. of Math. (2) 181 (2015); Granville's formulation, Theorem 6.2 of Primes in intervals of bounded length); Maynard's paper has its own library card.
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
- Problem 6: the theorem is the step from which the paper's Corollary 1 is deduced; on its own it orders no gaps.