Consecutive primes in tuples

William D. Banks; Tristan Freiberg; Caroline L. Turnage-Butterbaugh

Acta Arithmetica (2015)

  • Volume: 167, Issue: 3, page 261-266
  • ISSN: 0065-1036

Abstract

top
In a stunning new advance towards the Prime k-Tuple Conjecture, Maynard and Tao have shown that if k is sufficiently large in terms of m, then for an admissible k-tuple ( x ) = g x + h j j = 1 k of linear forms in ℤ[x], the set ( n ) = g n + h j j = 1 k contains at least m primes for infinitely many n ∈ ℕ. In this note, we deduce that ( n ) = g n + h j j = 1 k contains at least m consecutive primes for infinitely many n ∈ ℕ. We answer an old question of Erdős and Turán by producing strings of m + 1 consecutive primes whose successive gaps δ 1 , . . . , δ m form an increasing (resp. decreasing) sequence. We also show that such strings exist with δ j - 1 | δ j for 2 ≤ j ≤ m. For any coprime integers a and D we find arbitrarily long strings of consecutive primes with bounded gaps in the congruence class a mod D.

How to cite

top

William D. Banks, Tristan Freiberg, and Caroline L. Turnage-Butterbaugh. "Consecutive primes in tuples." Acta Arithmetica 167.3 (2015): 261-266. <http://eudml.org/doc/279690>.

@article{WilliamD2015,
abstract = {In a stunning new advance towards the Prime k-Tuple Conjecture, Maynard and Tao have shown that if k is sufficiently large in terms of m, then for an admissible k-tuple $(x) = \{gx + h_j\}_\{j=1\}^k$ of linear forms in ℤ[x], the set $(n) = \{gn + h_j\}_\{j=1\}^k$ contains at least m primes for infinitely many n ∈ ℕ. In this note, we deduce that $(n) = \{gn + h_j\}_\{j=1\}^k$ contains at least m consecutive primes for infinitely many n ∈ ℕ. We answer an old question of Erdős and Turán by producing strings of m + 1 consecutive primes whose successive gaps $δ_1,...,δ_m$ form an increasing (resp. decreasing) sequence. We also show that such strings exist with $δ_\{j-1\} | δ_j$ for 2 ≤ j ≤ m. For any coprime integers a and D we find arbitrarily long strings of consecutive primes with bounded gaps in the congruence class a mod D.},
author = {William D. Banks, Tristan Freiberg, Caroline L. Turnage-Butterbaugh},
journal = {Acta Arithmetica},
keywords = {consecutive primes in tuples; bounded gaps between primes; Maynard-Tao theorem},
language = {eng},
number = {3},
pages = {261-266},
title = {Consecutive primes in tuples},
url = {http://eudml.org/doc/279690},
volume = {167},
year = {2015},
}

TY - JOUR
AU - William D. Banks
AU - Tristan Freiberg
AU - Caroline L. Turnage-Butterbaugh
TI - Consecutive primes in tuples
JO - Acta Arithmetica
PY - 2015
VL - 167
IS - 3
SP - 261
EP - 266
AB - In a stunning new advance towards the Prime k-Tuple Conjecture, Maynard and Tao have shown that if k is sufficiently large in terms of m, then for an admissible k-tuple $(x) = {gx + h_j}_{j=1}^k$ of linear forms in ℤ[x], the set $(n) = {gn + h_j}_{j=1}^k$ contains at least m primes for infinitely many n ∈ ℕ. In this note, we deduce that $(n) = {gn + h_j}_{j=1}^k$ contains at least m consecutive primes for infinitely many n ∈ ℕ. We answer an old question of Erdős and Turán by producing strings of m + 1 consecutive primes whose successive gaps $δ_1,...,δ_m$ form an increasing (resp. decreasing) sequence. We also show that such strings exist with $δ_{j-1} | δ_j$ for 2 ≤ j ≤ m. For any coprime integers a and D we find arbitrarily long strings of consecutive primes with bounded gaps in the congruence class a mod D.
LA - eng
KW - consecutive primes in tuples; bounded gaps between primes; Maynard-Tao theorem
UR - http://eudml.org/doc/279690
ER -

NotesEmbed ?

top

You must be logged in to post comments.

To embed these notes on your page include the following JavaScript code on your page where you want the notes to appear.

Only the controls for the widget will be shown in your chosen language. Notes will be shown in their authored language.

Tells the widget how many notes to show per page. You can cycle through additional notes using the next and previous controls.

    
                

Note: Best practice suggests putting the JavaScript code just before the closing </body> tag.