Papers
Topics
Authors
Recent
Gemini 2.5 Flash
Gemini 2.5 Flash
133 tokens/sec
GPT-4o
7 tokens/sec
Gemini 2.5 Pro Pro
46 tokens/sec
o3 Pro
4 tokens/sec
GPT-4.1 Pro
38 tokens/sec
DeepSeek R1 via Azure Pro
28 tokens/sec
2000 character limit reached

Consecutive primes in tuples (1311.7003v3)

Published 27 Nov 2013 in math.NT

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 $\mathcal{H}(x) = {gx + h_j}{j=1}k$ of linear forms in $\mathbb{Z}[x]$, the set $\mathcal{H}(n) = {gn + h_j}{j=1}k$ contains at least $m$ primes for infinitely many $n \in \mathbb{N}$. In this note, we deduce that $\mathcal{H}(n) = {gn + h_j}{j=1}k$ contains at least $m$ consecutive primes for infinitely many $n \in \mathbb{N}$. We answer an old question of Erd\H os and Tur\'an by producing strings of $m + 1$ consecutive primes whose successive gaps $\delta_1,\ldots,\delta_m$ form an increasing (resp. decreasing) sequence. We also show that such strings exist with $\delta{j-1} \mid \delta_j$ for $2 \le j \le m$. For any coprime integers $a$ and $D$ we find arbitrarily long strings of consecutive primes with bounded gaps in the congruence class $a \bmod D$.

Summary

We haven't generated a summary for this paper yet.