Consecutive primes in tuples

Abstract

In a recent 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 H(x) = \gx + hj\j=1k of linear forms in Z[x], the set H(n) = \gn + hj\j=1k contains at least m primes for infinitely many n ∈ N. In this note, we deduce that H(n) = \gn + hj\j=1k contains at least m consecutive primes for infinitely many n ∈ N. We answer an old question of Erd os and Tur\'an 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 D.

0

Turn this paper into a lesson

ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.

Discussion (0)

Sign in to join the discussion.

Loading comments…