On the nth record gap between primes in an arithmetic progression

Abstract

Let $q>r\ge 1$ be coprime integers. Let $R(n,q,r)$ be the $n$th record gap between primes in the arithmetic progression $r$, $r+q$, $r+2q,\dots ,$ and denote by $N_{q,r}(x)$ the number of such records observed below $x$. For $x\to \infty$, we heuristically argue that if the limit of $N_{q,r}(x)/\log x$ exists, then the limit is 2. We also conjecture that $R(n,q,r)=O_q(n^2)$. Numerical evidence supports the conjectural (a.s.) upper bound $$R(n,q,r)<\phi (q)n^2+(n+2)q{\log }^{2}q.$$ The median (over $r$) of $R(n,q,r)$ grows like a quadratic function of $n$; so do the mean and quartile points of $R(n,q,r)$. For fixed values of $q\gtrsim 200$ and $n\approx 10$, the distribution of $R(n,q,r)$ is skewed to the right and close to both Gumbel and lognormal distributions; however, the skewness appears to slowly decrease as $n$ increases. The existence of a limiting distribution of $R(n,q,r)$ is an open question.

14 pages, 4 figures, 2 tables. Sequel to arXiv:1610.03340

References in corpus (4)

• Records in a changing world
• Nearest neighbor spacing distribution of prime numbers and quantum chaos
• Maximal gaps between prime k-tuples: a statistical approach
• On the distribution of maximal gaps between primes in residue classes

Cited by in corpus (3)

• Predicting maximal gaps in sets of primes
• On the distribution of maximal gaps between primes in residue classes
• On the first occurrences of gaps between primes in a residue class