Predicting maximal gaps in sets of primes

TL;DR

This paper develops heuristic formulas to predict the growth of maximal gaps between primes in specific residue classes and prime k-tuples, supported by extensive computational evidence up to 10^{14}.

Contribution

It introduces new trend formulas for maximal prime gaps in residue classes and prime k-tuples, validated by large-scale computations, and explores their distribution and conjectural properties.

Findings

Simple trend formula for k≥2 matches computational data.

Refined formula improves predictions for k=1, including all primes.

Maximal gaps distribution approximates Gumbel extreme value distribution.

Abstract

Let $q>r\ge1$ be coprime integers. Let ${\mathbb P}_c={\mathbb P}_c(q,r,{\cal H})$ be an increasing sequence of primes $p$ satisfying two conditions: (i) $p\equiv r$ (mod $q$) and (ii) $p$ starts a prime $k$-tuple with a given pattern ${\cal H}$. Let $\pi_c(x)$ be the number of primes in ${\mathbb P}_c$ not exceeding $x$. We heuristically derive formulas predicting the growth trend of the maximal gap $G_c(x)=\max_{p'\le x}(p'-p)$ between successive primes $p,p'\in{\mathbb P}_c$. Extensive computations for primes up to $10^{14}$ show that a simple trend formula $$G_c(x) \sim {x\over\pi_c(x)}\cdot(\log \pi_c(x) + O_k(1))$$ works well for maximal gaps between initial primes of $k$-tuples with $k\ge2$ (e.g., twin primes, prime triplets, etc.) in residue class $r$ (mod $q$). For $k=1$, however, a more sophisticated formula $$G_c(x) \sim {x\over\pi_c(x)}\cdot\big(\log{\pi_c^2(x)\over x}+O(\log q)\big)$$ gives a better prediction of maximal gap sizes. The latter includes the important special case of maximal gaps in the sequence of all primes ($k=1$, $q=2$, $r=1$). The distribution of appropriately rescaled maximal gaps $G_c(x)$ is close to the Gumbel extreme value distribution. Computations suggest that almost all maximal gaps satisfy a generalized strong form of Cramer's conjecture. We also conjecture that the number of maximal gaps between primes in ${\mathbb P}_c$ below $x$ is $O_k(\log x)$.

Tables

Table 1. Table 1: Exceptionally large maximal gaps: G q , r ​ ( p ) > φ ​ ( q ) ​ log 2 ⁡ p subscript 𝐺 𝑞 𝑟 𝑝 𝜑 𝑞 superscript 2 𝑝 G_{q,r}(p)>\varphi(q)\log^{2}p  for p < 10 9 𝑝 superscript 10 9 p<10^{9} ,   r < q ≤ 30000 𝑟 𝑞 30000 r<q\leq 30000 .

Gap $G_{q,r}\left(p\right)$	Start of Gap	End of Gap ($p$)	$𝒒$	$𝒓$	${𝑮}_{𝒒,𝒓}\left(𝒑\right)/(𝝋\left(𝒒\right){\mathrm{𝐥𝐨𝐠}}^{\mathrm{𝟐}}𝒑$)
$1^1$ (i)     208650	3415781	3624431	1605	341	1.0786589153
316790	726611	1043401	2005	801	1.0309808771
229350	1409633	1638983	2085	173	1.0145547849
532602	355339	887941	4227	271	1.0081862161
984170	5357381	6341551	4279	73	1.0339720553
1263426	10176791	11440217	4897	825	1.0056800570
2306938	82541821	84848759	6907	3171	1.0022590147
3415794	376981823	380397617	8497	3921	1.0703375544
2266530	198565889	200832419	8785	7319	1.0335372951
7326222	222677837	230004059	20017	8729	1.0166221904
6336090	10862323	17198413	23467	20569	1.0064940453
7230930	130172279	137403209	24595	15539	1.0468373915
5910084	51763573	57673657	28971	21367	1.0199911211
(ii)    411480	470669167	471080647	3048	55	1.0235488825
208650	3415781	3624431	3210	341	1.0786589153
316790	726611	1043401	4010	801	1.0309808771
229350	1409633	1638983	4170	173	1.0145547849
657504	896016139	896673643	4566	2563	1.0179389550
1530912	728869417	730400329	6896	3593	1.0684247390
532602	355339	887941	8454	271	1.0081862161
984170	5357381	6341551	8558	73	1.0339720553
1263426	10176791	11440217	9794	825	1.0056800570
2119706	665152001	667271707	10046	6341	1.0223668231
1885228	163504573	165389801	10532	5805	1.0000704209
1594416	145465687	147060103	13512	9007	1.0026889378
2306938	82541821	84848759	13814	3171	1.0022590147
3108778	524646211	527754989	15622	12585	1.0098218219
1896608	164663	2061271	16934	12257	1.0598397341
3415794	376981823	380397617	16994	3921	1.0703375544
2266530	198565889	200832419	17570	7319	1.0335372951
2937868	71725099	74662967	17698	12803	1.0103309882
2823288	37906669	40729957	18098	9457	1.0162761199
2453760	11626561	14080321	18176	12097	1.0107626289
3906628	190071823	193978451	18692	11567	1.1480589845
2157480	13074917	15232397	27660	19397	1.0716522452
5450496	366870073	372320569	28388	11949	1.0140771094
3422630	735473	4158103	29762	21185	1.0368176014
(iii)   657504	896016139	896673643	2283	280	1.0179389550
2119706	665152001	667271707	5023	1318	1.0223668231
3108778	524646211	527754989	7811	4774	1.0098218219
1896608	164663	2061271	8467	3790	1.0598397341
2937868	71725099	74662967	8849	3954	1.0103309882
2823288	37906669	40729957	9049	408	1.0162761199
3422630	735473	4158103	14881	6304	1.0368176014
3758772	144803717	148562489	15927	11360	1.0000152764
3002682	8462609	11465291	16869	11240	1.0107025944
8083028	344107541	352190569	19619	9900	1.1134625422
4575906	20250677	24826583	22653	21548	1.0463153374
5609136	34016537	39625673	26967	11150	1.0412524005
7044864	302145839	309190703	27519	14738	1.0048671503
6580070	9659921	16239991	28609	18688	1.0046426332

Equations

$$G_c(x)\sim \frac{x}{{\pi }_c(x)}\cdot (\log {\pi }_c(x)+O_k(1))$$

$$G_{c}(x)\sim\frac{x}{\pi_{c}(x)}\cdot\big{(}\log{\frac{\pi_{c}^{2}(x)}{x}}+O(\log q)\big{)}$$

$$G(x)=\underset{p_{n+1}\le x}{\max }(p_{n+1}-p_n).$$

$$G(x)\sim \frac{x}{\pi (x)}\cdot \left(\log \frac{{\pi }^2(x)}{x}+O(1)\right),$$

$$G_k(x)\sim a(x)\cdot \left(\log \frac{x}{a(x)}+O(1)\right),$$

$$G_c(x)=\underset{\genfrac{}{}{0ex}{}{p^{\prime }\le x}{p,p^{\prime }\in {\mathbb{P}}_c}}{\max }(p^{\prime }-p).$$

$$\text{mbox}maximalgapsize\sim (\text{mbox}averagegapnearx)\cdot L(x),\text{mbox}withL(x)\lesssim c\log x,$$

$$\pi (x;q,r)\sim \frac{\mathrm{li}x}{\phi (q)}\text{mbox}asx\to \infty .$$

$$\pi (x;q,r)=\frac{\mathrm{li}x}{\phi (q)}+O_{\epsilon }(x^{1/2+\epsilon })\text{mbox}forany\epsilon >0.$$

$$\gcd (r+{\Delta }_1,q)=\gcd (r+{\Delta }_2,q)=\gcd (r+{\Delta }_3,q)=\dots =\gcd (r+{\Delta }_k,q)=1.$$

$${\phi }_{k,\mathcal{H}}(q)=\sum _{\genfrac{}{}{0ex}{}{1\le x\le q}{\gcd (x+{\Delta }_1,q)=\cdots =\gcd (x+{\Delta }_k,q)=1}}1.$$

$$k=4,\mathcal{H}=({\Delta }_1,{\Delta }_2,{\Delta }_3,{\Delta }_4)=(0,2,6,8),\text{mbox}and{\phi }_{4,\mathcal{H}}(q)=\text{mbox}\text{href}tp://oeis.org/A319516(q).$$

$${\pi }_c(x)=\frac{C_{k,\mathcal{H}}}{{\phi }_{k,\mathcal{H}}(q)}{\mathrm{Li}}_k(x)+O_{\eta ,\mathcal{H}}(x^{\eta })\text{mbox}asx\to \infty ,$$

$$a_c(x)=\frac{{\phi }_{k,\mathcal{H}}(q)}{C_{k,\mathcal{H}}}\cdot \frac{x}{{\mathrm{Li}}_k(x)}.$$

$${\bar{a}}_c(x)=\frac{{\phi }_{k,\mathcal{H}}(q)}{C_{k,\mathcal{H}}}\cdot {\log }^{k}x.$$

$$\frac{x}{{\pi }_c(x)}\approx a_c(x)<{\bar{a}}_c(x)\text{mbox}forlargex.$$

$$\underset{x\to \infty }{\lim }\frac{a_c(x)}{{\bar{a}}_c(x)}=1,$$

$$\underset{x\to \infty }{\lim }\frac{{\bar{a}}_c(x)-a_c(x)}{{\bar{a}}_c(x)}\cdot \log x=k.$$

$$\text{mbox}expectedmaximalinterval=\alpha \log \frac{x}{\alpha }+O(\alpha )=\frac{x}{\Pi (x)}\log \Pi (x)+O(\alpha ),$$

$$T_c(x)=a_c(x)\cdot \log \frac{C_{k,\mathcal{H}}{\mathrm{Li}}_k(x)}{{\phi }_{k,\mathcal{H}}(q)}.$$

$$T_c(x)\approx a_c(x)\cdot \log {\pi }_c(x)\approx \frac{x}{{\pi }_c(x)}\cdot \log {\pi }_c(x)\text{mbox}asx\to \infty .$$

$${\bar{T}}_c(x)={\bar{a}}_c(x)\cdot \log \frac{x}{{\bar{a}}_c(x)}.$$

$$T_c(x)<{\bar{T}}_c(x)<C_{k,\mathcal{H}}^{-1}{\phi }_{k,\mathcal{H}}(q)\cdot {\log }^{k+1}x\text{mbox}forlargex.$$

$$T_c(x)\sim {\bar{T}}_c(x)\sim C_{k,\mathcal{H}}^{-1}{\phi }_{k,\mathcal{H}}(q)\cdot {\log }^{k+1}x\text{mbox}asx\to \infty .$$

$$\underset{x\to \infty }{\lim }\frac{{\bar{T}}_c(x)-T_c(x)}{{\bar{a}}_c(x)}=k,$$

$$\underset{x\to \infty }{\lim }\frac{C_{k,\mathcal{H}}^{-1}{\phi }_{k,\mathcal{H}}(q){\log }^{k+1}x-{\bar{T}}_c(x)}{{\bar{a}}_c(x)\log \log x}=k.$$

$$T_c(x)\lesssim G_c(x)\lesssim {\bar{T}}_c(x)\text{mbox}asx\to \infty ,$$

$$G_c(p)<C_{k,\mathcal{H}}^{-1}{\phi }_{k,\mathcal{H}}(q){\log }^{k+1}p.$$

$$G_c(p)\sim C_{k,\mathcal{H}}^{-1}{\phi }_{k,\mathcal{H}}(q){\log }^{k+1}p\text{mbox}asp\to \infty .$$

$${\tau }_{q,r}(d,x)\approx P_q(d)B_q(x)e^{-d\cdot A_q(x)},$$

Full text

[TABLE]

works well for maximal gaps between initial primes of $k$-tuples with $k\geq 2$ (e.g., twin primes, prime triplets, etc.) in residue class $r$ (mod $q$). For $k=1$, however, a more sophisticated formula

[TABLE]

gives a better prediction of maximal gap sizes. The latter includes the important special case of maximal gaps in the sequence of all primes ($k=1$, $q=2$, $r=1$). The distribution of appropriately rescaled maximal gaps $G_{c}(x)$ is close to the Gumbel extreme value distribution. Computations suggest that almost all maximal gaps satisfy a generalized strong form of Cramér’s conjecture. We also conjecture that the number of maximal gaps between primes in ${\mathbb{P}}_{c}$ below $x$ is $O_{k}(\log x)$.

\pubvolume

7 \issuenum5 \articlenumber400

\historyThis is arXiv:1901.03785.  See the published article at  https://doi.org/10.3390/math7050400 \TitlePredicting Maximal Gaps in Sets of Primes \AuthorAlexei Kourbatov1 and Marek Wolf 2 \AuthorNamesAlexei Kourbatov and Marek Wolf

1 Introduction

A prime gap is the difference between consecutive prime numbers. The sequence of prime gaps behaves quite erratically (see OEIS A001223 oeis ). While the prime number theorem tells us that the average gap between primes near $x$ is about $\log x$, the actual gaps near $x$ can be significantly larger or smaller than $\log x$. We call a gap maximal if it is strictly greater than all gaps before it. Large gaps between primes have been studied by many authors; see, e.g., ramanujannotebooks4 ; bhp2001 ; cramer ; fgkmt ; funkhouser2018 ; granville ; nicely ; nicelynyman2003 ; toes2014 ; shanks . In the early 1910s, Ramanujan considered maximal prime gaps up to low 7-digit primes (ramanujannotebooks4, , p. 133). More than a century later, we know all maximal gaps between primes below $2^{64}$ nicely .

Let $G(x)$ be the maximal gap between primes not exceeding $x$:

[TABLE]

Estimating $G(x)$ is a subtle and delicate problem. Cramér cramer conjectured on probabilistic grounds that $G(x)=O(\log^{2}x)$, while Shanks shanks heuristically found that $G(x)\sim\log^{2}x$. Granville granville heuristically argued that for a certain subsequence of maximal gaps we should expect significantly larger sizes of $G(x)$; namely, $\limsup\limits_{x\to\infty}\frac{G(x)}{\log^{2}x}\geq 2e^{-\gamma}\approx 1.1229$.

Baker, Harman, and Pintz bhp2001 proved that $G(x)=O(x^{0.525})$; indeed, computation suggests that $G(x)<x^{0.525}$ for $x\geq 153$. Ford, Green, Konyagin, Maynard, and Tao fgkmt proved that the order of $G(x)$ is at least $\frac{c\log x\log\log x\log\log\log\log x}{\log\log\log x}$, solving a long-standing conjecture of Erdős.

Earlier, we independently proposed formulas closely related to the Cramér and Shanks conjectures. Wolf wolf1998 ; wolf2011 ; wolf2014 expressed the probable size of maximal gaps $G(x)$ in terms of the prime-counting function $\pi(x)$:

[TABLE]

which suggests an analog of Shanks conjecture $G(x)\sim\log^{2}x-2\log x\log\log x+O(\log x)$; see also Cadwell cadwell . Extending the problem statement to prime $k$-tuples, Kourbatov kourbatov2013 ; kourbatov2013tables empirically tested (for $x\leq 10^{15}$, $k\leq 7$) the following heuristic formula for the probable size of maximal gaps $G_{k}(x)$ between prime $k$-tuples below $x$:

[TABLE]

where $a(x)$ is the expected average gap between the particular prime $k$-tuples near $x$. Similar to (1), formula (2) also suggests an analog of the Shanks conjecture, $G_{k}(x)\sim C\log^{k+1}x$, with a negative correction term of size O_{k}\big{(}(\log x)^{k}\log\log x\big{)}; see also ford2018 ; toes2015 .

In this paper we study a further generalization of the prime gap growth problem, viz.: What happens to maximal gaps if we only look at primes in a specific residue class mod $q$? The new problem statement subsumes, as special cases, maximal prime gaps ($k=1$, $q=2$) as well as maximal gaps between prime $k$-tuples ($k\geq 2$, $q=2$). One of our present goals is to generalize formulas (1) and (2) to gaps between primes in a residue class—and test them in computational experiments. Another goal is to investigate how many maximal gaps should be expected between primes $p\leq x$ in a residue class, with an additional (optional) condition that $p$ starts a prime constellation of a certain type.

1.1 Notation

[TABLE]

[TABLE]

Quantities with the $c$ subscript may, in general, depend on $q$, $r$, $k$, and on the pattern of the prime $k$-tuple. However, average gaps $a$, $a_{c}$, $\bar{a}_{c}$ and trend functions $T$, $T_{c}$, $\bar{T}_{c}$ are independent of $r$. Expressions like $\pi_{c}^{2}(x)$ or $\log^{2}x$ denote the square of the respective function.

1.2 Definitions: Prime $k$-Tuples, Gaps, Sequence ${\mathbb{P}}_{c}$

Prime $k$-tuples are clusters of $k$ consecutive primes that have an admissible111 A $k$-tuple is admissible (infinitely repeatable) unless it is prohibited by an elementary divisibility argument. For example, the cluster of five numbers ($p$, $p+2$, $p+4$, $p+6$, $p+8$) is prohibited because one of the numbers is divisible by 5 (and, moreover, at least one of the numbers is divisible by 3); hence all these five numbers cannot simultaneously be prime infinitely often. Likewise, the cluster of three numbers ($p$, $p+2$, $p+4$) is prohibited because one of the numbers is divisible by 3; so these three numbers cannot simultaneously be prime infinitely often. pattern ${\cal H}$. In what follows, when we speak of a $k$-tuple, for certainty we will mean a densest admissible prime $k$-tuple, with a given $k\leq 7$. However, our observations can be extended to other admissible $k$-tuples, including those with larger $k$ and not necessarily densest ones. The densest $k$-tuples that exist for a given $k$ may sometimes be called prime constellations or prime $k$-tuplets. Below are examples of prime $k$-tuples with $k=2$, 4, 6.

• •

Twin primes are pairs of consecutive primes that have the form ($p$, $p+2$). This is the densest admissible pattern of two; ${\cal H}=(0,2)$.

• •

Prime quadruplets are clusters of four consecutive primes of the form ($p$, $p+2$, $p+6$, $p+8$). This is the densest admissible pattern of four; ${\cal H}=(0,2,6,8)$.

• •

Prime sextuplets are clusters of six consecutive primes ($p$, $p+4$, $p+6$, $p+10$, $p+12$, $p+16$). This is the densest admissible pattern of six; ${\cal H}=(0,4,6,10,12,16)$.

A gap between prime $k$-tuples is the distance $p^{\prime}-p$ between the initial primes $p$ and $p^{\prime}$ in two consecutive $k$-tuples of the same type (i.e., with the same pattern). For example, the gap between twin prime pairs $(17,19)$ and $(29,31)$ is 12:  $p^{\prime}-p~{}=~{}29-17~{}=~{}12.$

A maximal gap between prime $k$-tuples is a gap that is strictly greater than all gaps between preceding $k$-tuples of the same type. For example, the gap of size 6 between twin primes $(5,7)$ and $(11,13)$ is maximal, while the gap (also of size 6) between twin primes $(11,13)$ and $(17,19)$ is not maximal.

Let $q>r\geq 1$ be coprime integers. Let ${\mathbb{P}}_{c}={\mathbb{P}}_{c}(q,r,{\cal H})$ be an increasing sequence of primes $p$ satisfying two conditions: (i) $p\equiv r$ (mod $q$) and (ii) $p$ starts a prime $k$-tuple with a given pattern ${\cal H}$. Importantly, ${\mathbb{P}}_{c}$ depends on $q$, $r$, $k$, and on the pattern of the $k$-tuple. When $k=1$,  ${\mathbb{P}}_{c}$ is the sequence of all primes $p\equiv r$ (mod $q$). Gaps between primes in ${\mathbb{P}}_{c}$ are defined as differences $p^{\prime}-p$ between successive primes $p,p^{\prime}\in{\mathbb{P}}_{c}$. As before, a gap is maximal if it is strictly greater than all preceding gaps. Accordingly, for successive primes $p,p^{\prime}\in{\mathbb{P}}_{c}$ we define

[TABLE]

Studying maximal gaps between primes in ${\mathbb{P}}_{c}$ is convenient. Indeed, if the modulus $q$ used for defining ${\mathbb{P}}_{c}$ is “not too small”, we get plenty of data to study maximal gaps; that is, we get many sequences of maximal gaps corresponding to ${\mathbb{P}}_{c}$’s with different $r$ for the same $q$, which allows us to study common properties of these sequences. (One such property is the average number of maximal gaps between primes in ${\mathbb{P}}_{c}$ below $x$.) By contrast, data on maximal prime gaps are scarce: at present we know that there are only 80 maximal gaps between primes below $2^{64}$ nicely . Even fewer maximal gaps are known between $k$-tuples of any given type kourbatov2013tables .

{Remark}

1. (i)

In Section 2 we derive formulas predicting the most probable sizes of maximal gaps $G_{c}(x)$. It is not known how close these most probable sizes might be to the maximal order of $G_{c}(x)$. Thus, in the special case $k=1$, $q=2$, probable values of $G(x)$ seem to be $\sim\log^{2}x-2\log x\log\log x$ wolf2011 ; but it is not implausible that the maximal order of $G(x)$ is closer to $2e^{-\gamma}\log^{2}x$  granville . For further discussion of extremely large gaps, see Section 3.5. 2. (ii)

How hard is it to compute gaps in sequence ${\mathbb{P}}_{c}$? Given $k=1$, $q\approx 10^{3}$ and $r$ coprime to $q$, our PARI/GP code (Appendix A) takes several hours to compute all maximal gaps in sequence ${\mathbb{P}}_{c}$ up to 14-digit primes. In some numerical experiments, we carried out the computation all the way to $10^{14}$. In most cases, however, we stopped the computation at $e^{28}$ or at $10^{12}$ or even earlier, to quickly gather statistics for all $r$ coprime to $q$. A similar strategy was also used for sequences ${\mathbb{P}}_{c}$ with $k\geq 2$ (source code for $k\geq 2$ is not included). See Section 3 for a detailed discussion of our numerical results.

1.3 Generalization to Other Subsets of Primes

Sequences ${\mathbb{P}}_{c}$ include, as special cases, many different subsets of prime numbers: primes in a given residue class, twin primes, triplets, quadruplets, etc. However, formulas akin to (1) and (2) definitely have an even wider area of applicability. Namely, we expect that certain analogs of (1) or (2), possessing the general form

[TABLE]

will also be applicable to maximal gaps in the following subsets of primes:

• •

the sequence of prime-indexed primes bb2009 , A006450

• •

higher iterates of prime-indexed primes bko2013 ; batchko2014 ; guariglia2019 , A038580

• •

primes $p=n^{2}+1$,  $n\in{\mathbb{N}}$ wolf2013 , A002496

• •

primes $p=f(n)$, where $f(n)$ is an irreducible polynomial in $n$,

• •

primes in sequences of Beatty type: $p=\lfloor\beta n+\delta\rfloor$,  $n\in{\mathbb{N}}$,  for a fixed irrational $\beta>1$ and a fixed real $\delta$ bakerzhao2016 , A132222.

The above list is by no means exhaustive, but it may serve as a starting point for future work.

1.4 When Are Equations (1), (2) Inapplicable?

Analogs of Equations (1) and (2) are not applicable to sequences where (almost) every gap is maximal. Examples of this kind include:

• •

Mills primes mills , A051254,

• •

base-$B$ repunit primes salas2011 , A076481,

• •

primes nearest to $e^{n}$ (A037028),

• •

in general, any sequence whose terms grow exponentially or super-exponentially.

2 Heuristics and Conjectures

We now focus on deriving analogs of formulas (1) and (2) for sequences ${\mathbb{P}}_{c}={\mathbb{P}}_{c}(q,r,{\cal H})$.

2.1 Equidistribution of $k$-Tuples

Everywhere we assume that $q>r$ are coprime positive integers. Let $\pi(x;q,r)$ be the number of primes $p\equiv r$ (mod $q$) such that $p\leq x$. The prime number theorem for arithmetic progressions fine2016 ; fgoldston1996 establishes that

[TABLE]

Furthermore, the generalized Riemann hypothesis (GRH) implies that

[TABLE]

That is to say, the primes below $x$ are approximately equally distributed among the $\varphi(q)$ “allowed” residue classes (these classes form the reduced residue system modulo $q$). Roughly speaking, the GRH implies that, as $x\to\infty$, the numbers $\pi(x;q,r)$ and $\lfloor\mathop{\mathrm{li}}x/\varphi(q)\rfloor$ almost agree in the left half of their digits.

Based on empirical evidence, below we conjecture that a similar phenomenon also occurs for prime $k$-tuples: in every ${\cal H}$-allowed residue class (as defined in Section 2.1.1) there are infinitely many primes starting an admissible $k$-tuple with a particular pattern ${\cal H}$. Moreover, such primes are distributed approximately equally among all ${\cal H}$-allowed residue classes modulo $q$. Our conjectures are closely related to the Hardy–Littlewood $k$-tuple conjecture hl1923 and the Bateman–Horn conjecture bh1962 .

2.1.1 Counting the ${\cal H}$-Allowed Residue Classes

Consider an example: take ${\cal H}=(0,2)$. Which residue classes modulo 4 may contain the lesser prime $p$ in a pair of twin primes $(p,\,p+2)$? Clearly, the residue class 0 mod 4 is prohibited: all numbers in this class are even. The residue class 2 mod 4 is prohibited for the same reason. The remaining residue classes, $p\equiv 1$ mod 4 and $p\equiv 3$ mod 4, are not prohibited. We call these two classes ${\cal H}$-allowed. Indeed, each of these two residue classes does contain lesser twin primes—and there are, conjecturally, infinitely many such primes in each class (see OEIS A071695 and A071698).

In general, given an admissible $k$-tuple with pattern ${\cal H}=(\Delta_{1},\Delta_{2},\ldots,\Delta_{k})$, we say that a residue class $r$ (mod $q$) is ${\cal H}$-allowed if

[TABLE]

Thus a residue class is ${\cal H}$-allowed if it is not prohibited (by divisibility considerations) from containing infinitely many primes $p$ starting a prime $k$-tuple with pattern ${\cal H}$.

How many residue classes modulo $q$ are ${\cal H}$-allowed? To count them, we will need an appropriate generalization of Euler’s totient $\varphi(q)$: Golubev’s totient functions golubev1953 ; golubev1958 ; golubev1962 ; see also (SandorCrstici2004II, , p. 289).

{Definition}

Golubev’s totient $\varphi_{k,{\cal H}}(q)$ is the number of ${\cal H}$-allowed residue classes modulo $q$ for a given pattern ${\cal H}=(\Delta_{1},\ldots,\Delta_{k})$. More formally,

[TABLE]

{Example}

For prime quadruplets $(p,p+2,p+6,p+8)$ we have

[TABLE]

For instance, when $q=30$, we have $\varphi_{4,{\cal H}}(q)=1$: indeed, there is only one residue class, namely, $p\equiv 11$ (mod 30) where divisibility considerations allow infinitely many primes $p$ at the beginning of prime quadruplets $(p,p+2,p+6,p+8)$.

Note that $\varphi_{1}(q)=\varphi(q)$ is Euler’s totient function, A000010; and, for densest admissible $k$-tuples, $\varphi_{2,{\cal H}}(q)$ is A002472, see also Alder alder1958 ; $\varphi_{3,{\cal H}}(q)$ is A319534; $\varphi_{4,{\cal H}}(q)$ is A319516; $\varphi_{5,{\cal H}}(q)$ is A321029; and $\varphi_{6,{\cal H}}(q)$ is A321030. Like Euler’s totient, the functions $\varphi_{k,{\cal H}}$ are multiplicative golubev1958 .

2.1.2 The $k$-Tuple Infinitude Conjecture

We expect each of the ${\cal H}$-allowed residue classes $r$ (mod $q$) to contain infinitely many primes $p$ starting admissible prime $k$-tuples with pattern ${\cal H}$. In other words, the corresponding sequence ${\mathbb{P}}_{c}={\mathbb{P}}_{c}(q,r,{\cal H})$ is infinite.

{Remark}

1. (i)

The $k$-tuple infinitude conjecture generalizes Dirichlet’s theorem on arithmetic progressions dirichlet . 2. (ii)

The conjecture follows from the Bateman–Horn conjecture bh1962 .

2.1.3 The $k$-Tuple Equidistribution Conjecture

Suppose the residue class $r$ (mod $q$) is ${\cal H}$-allowed. We conjecture that the number of primes $p\in{\mathbb{P}}_{c}(q,r,{\cal H})$, $p\leq x$, is

[TABLE]

where $\eta<1$, the coefficient $C_{k,{\cal H}}$ is the Hardy–Littlewood constant for the particular $k$-tuple (Appendix B), ${\mathop{\mathrm{Li}}}_{k}(x)=\int_{2}^{x}\log^{-k}t\,dt$ (Appendix C), and $\varphi_{k,{\cal H}}(q)$ is Golubev’s totient function (5).

{Remark}

1. (i)

Conjecture (6) is akin to the GRH-based Equation (4); the latter pertains to the case $k=1$. 2. (ii)

The conjecture is compatible with the Bateman–Horn and Hardy–Littlewood $k$-tuple conjectures but does not follow from them. 3. (iii)

It is plausible that, similar to (4), in (6) we can take $\eta=\frac{1}{2}+\varepsilon$ for any $\varepsilon>0$.

2.2 Average Gap Sizes

Consider a sequence ${\mathbb{P}}_{c}={\mathbb{P}}_{c}(q,r,{\cal H})$, where the residue class $r$ (mod $q$) is ${\cal H}$-allowed. We define the expected average gaps between primes in ${\mathbb{P}}_{c}$ as follows.

{Definition}

The expected average gap between primes in ${\mathbb{P}}_{c}$ below $x$ is

[TABLE]

{Definition}

The expected average gap between primes in ${\mathbb{P}}_{c}$ near $x$ is

[TABLE]

In view of the equidistribution conjecture (6), it is easy to see from these definitions that

[TABLE]

We have the limits (with very slow convergence):

[TABLE]

[TABLE]

2.3 Maximal Gap Sizes

Recall that formula (1) is applicable to the special case $q=2,k=1$ wolf1998 ; wolf2011 ; wolf2014 , while (2) is applicable to the special cases $q=2,k\geq 2$ kourbatov2013 . We are now ready to generalize (1) and (2) for predicting maximal gaps between primes in sequences ${\mathbb{P}}_{c}$ with $q\geq 2$.

2.3.1 Case of $k$-Tuples: $k\geq 2$

Consider a probabilistic example. Suppose that intervals between rare random events are exponentially distributed, with cdf $\mathop{\mathrm{Exp}}(\xi;\alpha)=1-e^{-\xi/\alpha}$, where $\alpha$ is the mean interval between events. If our observations of the events continue for $x$ seconds, extreme value theory (EVT) predicts that the expected maximal interval between events is

[TABLE]

where $\Pi(x)\approx x/\alpha$ is the total count of the events we observed in $x$ seconds. (For details on deriving Equation (11), see e.g. (gumbel1958, , pp. 114–116) or (kourbatov2013, , Sect. 8).)

By analogy with EVT, we define the expected trend functions for maximal gaps as follows.

{Definition}

The lower trend of maximal gaps between primes in ${\mathbb{P}}_{c}$ is

[TABLE]

In view of the equidistribution conjecture (6),

[TABLE]

We also define another trend function, $\bar{T}_{c}(x)$, which is simpler because it does not use $\mathop{\mathrm{Li}}_{k}(x)$.

{Definition}

The upper trend of maximal gaps between primes in ${\mathbb{P}}_{c}$ is

[TABLE]

The above definitions imply that

[TABLE]

At the same time, we have the asymptotic equivalence:

[TABLE]

We have the limits (convergence is quite slow):

[TABLE]

[TABLE]

Therefore, $\bar{T}_{c}(x)-T_{c}(x)=O_{k}(\bar{a}_{c})$, while  $C_{k,{\cal H}}^{-1}\,\varphi_{k,{\cal H}}(q)\log^{k+1}x-\bar{T}_{c}(x)=O_{k}(\bar{a}_{c}\log\log x)$.

We make the following conjectures regarding the behavior of maximal gaps $G_{c}(x)$.

Conjecture on the trend of $G_{c}(x)$. For any sequence ${\mathbb{P}}_{c}$ with $k\geq 2$, a positive proportion of maximal gaps $G_{c}(x)$ satisfy the double inequality

[TABLE]

and the difference $G_{c}(x)-\bar{T}_{c}(x)$ changes its sign infinitely often.

Generalized Cramér conjecture for $G_{c}(p)$. Almost all maximal gaps $G_{c}(p)$ satisfy

[TABLE]

Generalized Shanks conjecture for $G_{c}(p)$. Almost all maximal gaps $G_{c}(p)$ satisfy

[TABLE]

Here $G_{c}(p)$ denotes the maximal gap that ends at the prime $p$.

2.3.2 Case of Primes: $k=1$

The EVT-based trend formulas (12) and (14) work well for maximal gaps between $k$-tuples, $k\geq 2$. However, when $k=1$, the observed sizes of maximal gaps $G_{q,r}(x)$ between primes in residue class $r$ mod $q$ are usually a little less than predicted by the corresponding lower trend formula akin to (12). For example, with $k=1$ and $q=2$, the most probable values of maximal prime gaps $G(x)$ turn out to be less than the EVT-predicted value $\frac{x\log\mathop{\mathrm{li}}x}{\mathop{\mathrm{li}}x}$—less by approximately $\log x\log\log x$ (cf. Cadwell (cadwell, , p. 912)). In this respect, primes do not behave like “random darts”. Instead, the situation looks as if primes “conspire together” so that each prime $p_{n}\leq x$ lowers the typical maximal gap $G(x)$ by about $p_{n}^{-1}\log x$; indeed, we have $\sum_{p_{n}\leq x}p_{n}^{-1}\sim\log\log x.$ Below we offer a heuristic explanation of this phenomenon.

Let $\tau_{q,r}(d,x)$ be the number of gaps of a given even size $d=p^{\prime}-p$ between successive primes $p,p^{\prime}\equiv r$ (mod $q$), $p^{\prime}\leq x$. Empirically, the function $\tau_{q,r}$ has the form (cf. AresCastro2006 ; goldstonledoan2011 ; wolf2011 )

[TABLE]

where $P_{q}(d)$ is an oscillating factor (encoding a form of singular series), and

[TABLE]

The essential point now is that we can find the unknown functions $A_{q}(x)$ and $B_{q}(x)$ in (22) just by assuming the exponential decay of $\tau_{q,r}$ as a function of $d$ and employing the following two conditions (which are true by definition of $\tau_{q,r}$):

[TABLE]

[TABLE]

The erratic behavior of the oscillating factor $P_{q}(d)$ presents an obstacle in the calculation of sums (24) and (25). We will assume that, for sufficiently regular functions $f(d,x)$,

[TABLE]

where $s$ is such that, on average, $P_{q}(d)\approx s$; and the summation is for $d$ such that both sides of (26) are non-zero. Extending the summation in Equations (24), (25) to infinity, using (26), and writing

[TABLE]

we obtain two series expressions: (24) gives us a geometric series

[TABLE]

while (25) yields a differentiated geometric series

[TABLE]

Thus we have obtained two equations:

[TABLE]

To solve these equations, we use the approximations $e^{-cA_{q}(x)}\approx 1$ and $1-e^{-cA_{q}(x)}\approx cA_{q}(x)$ (which is justified because we expect $A_{q}(x)\to 0$ for large $x$). In this way we obtain

[TABLE]

A posteriori we indeed see that $A_{q}(x)\to 0$ as $x\to\infty$. Substituting (29) into (22) we get

[TABLE]

From (30) we can obtain an approximate formula for $G_{q,r}(x)$. Note that $\tau_{q,r}(d,x)=1$ when the gap of size $d$ is maximal—in which case we have $d=G_{q,r}(x)$. So, to get an approximate value of the maximal gap $G_{q,r}(x)$, we solve for $d$ the equation $\tau_{q,r}(d,x)=1$, or

[TABLE]

where we skipped $P_{q}(d)/s$ because, on average, $P_{q}(d)\approx s$. Taking the log of both sides of (31) we find the solution $G_{q,r}(x)$ expressed directly in terms of $\pi(x;q,r)$:

[TABLE]

Since $\pi(x;q,r)\approx\displaystyle\frac{\mathop{\mathrm{li}}x}{\varphi(q)}$ and $\displaystyle\log\frac{\pi^{2}(x;q,r)}{x}\approx 2\log\frac{\mathop{\mathrm{li}}x}{\varphi(q)}-\log x$, we can state the following

Conjecture on the trend of $G_{q,r}(x)$. The most probable sizes of maximal gaps $G_{q,r}(x)$ are near a trend curve $T(q,x)$:

[TABLE]

where $b=b(q,x)=O(\log q)$ tends to a constant as $x\to\infty$. The difference $G_{q,r}(x)-T(q,x)$ changes its sign infinitely often.

Further, we expect that the width of distribution of the maximal gaps near $x$ is $O_{q}(\log x)$; i.e., the width of distribution is on the order of the average gap $\varphi(q)\log x$ (see Section 3.2). On the other hand, for large $x$, the trend (33) differs from the line $\varphi(q)\log^{2}x$ by $O_{q}(\log x\log\log x)$, that is, by much more than the average gap. This suggests natural generalizations of the Cramér and Shanks conjectures:

Generalized Cramér conjecture for $G_{q,r}(p)$. Almost all maximal gaps $G_{q,r}(p)$ satisfy

[TABLE]

Generalized Shanks conjecture for $G_{q,r}(p)$. Almost all maximal gaps $G_{q,r}(p)$ satisfy

[TABLE]

Conjectures (34) and (35) can be viewed as particular cases of (20), (21) for $k=1$.

2.4 How Many Maximal Gaps Are There?

This section generalizes the heuristic reasoning of (kourbatov2017, , Sect. 2.3). Let $R_{c}(n)$ be the size of the $n$-th record (maximal) gap between primes in ${\mathbb{P}}_{c}$. Denote by $N_{c}(x)$ the total number of maximal gaps observed between primes in ${\mathbb{P}}_{c}$ not exceeding $x$. Let $\ell=\ell(x;q,{\cal H})$ be a continuous slowly varying function estimating $\mathop{\mathrm{mean}}\limits_{r}(N_{c}(ex)-N_{c}(x))$, the average number of maximal gaps between primes in ${\mathbb{P}}_{c}$, with the upper endpoints $p^{\prime}\in[x,ex]$. For $x\to\infty$, we will heuristically argue that if the limit of $\ell$ exists, then the limit is $k+1$. Suppose that

[TABLE]

and the limit $\ell_{*}$ is independent of $q$. Let $n$ be a “typical” number of maximal gaps up to $x$; our assumption $\lim\limits_{x\to\infty}\ell=\ell_{*}$ means that

[TABLE]

For large $n$, we can estimate the order of magnitude of the typical $n$-th maximal gap $R_{c}(n)$ using the generalized Cramér and Shanks conjectures (20) and (21):

[TABLE]

Define $\Delta R_{c}(n)=R_{c}(n+1)-R_{c}(n).$ By formula (37), for large $q$ and large $n$ we have

[TABLE]

[TABLE]

where the mean is taken over all ${\cal H}$-allowed residue classes; see Sect. 2.1.1. Combining this with (36), we find

[TABLE]

On the other hand, heuristically we expect that, on average, two consecutive record gaps should differ by the “local” average gap (8) between primes in ${\mathbb{P}}_{c}$:

[TABLE]

Together, Equations (38) and (39) imply that

[TABLE]

Therefore, for large $x$ we should expect (see Sections 3.3 and 3.4; cf. krug2007 )

[TABLE]

**Special cases. ** For the number $N_{q,r}$ of maximal gaps between primes $p\equiv r$ (mod $q$) we have

[TABLE]

This is asymptotically equivalent to the following semi-empirical formula for the number of maximal prime gaps up to $x$ (i.e., for the special case $k=1$, $q=2$; see (kourbatov2016, , Sect. 3.4; OEIS A005669)):

[TABLE]

Formula (42) tells us that maximal prime gaps occur, on average, about twice as often as records in an i.i.d. random sequence of $\lfloor\mathop{\mathrm{li}}x\rfloor$ terms. Note also the following straightforward generalization of (42) giving a very rough estimate of $N_{q,r}(x)$ for $k=1$:

[TABLE]

Computation shows that, for the special case of maximal prime gaps $G(x)$, formula (42) works quite well. However, the more general formula (43) usually overestimates $N_{q,r}(x)$. At the same time, the right-hand side of (43) is less than $2\log x$. Thus the right-hand sides of (41) as well as (43) overestimate the actual gap counts $N_{q,r}(x)$ in most cases.

In Section 3.3 we will see an alternative (a posteriori) approximation based on the average number of maximal gaps observed for primes in the interval $[x,ex]$. Namely, the estimated average number $\ell(x;q,{\cal H})$ of maximal gaps with endpoints in $[x,ex]$ is

[TABLE]

3 Numerical Results

To test our conjectures of the previous section, we performed extensive computational experiments. We used PARI/GP (see Appendix A for code examples) to compute maximal gaps $G_{c}$ between initial primes $p=r+nq\in{\mathbb{P}}_{c}$ in densest admissible prime $k$-tuples, $k\leq 6$. We experimented with many different values of $q\in[4,10^{5}]$. To assemble a complete data set of maximal gaps for a given $q$, we used all ${\cal H}$-allowed residue classes $r$ (mod $q$). For additional details of our computational experiments with maximal gaps between primes $p=r+nq$ (i.e., for the case $k=1$), see also (kourbatov2016, , Sect. 3). In this section we omit the subscript ${\cal H}$ in $\varphi_{k}$ and $C_{k}$ because we are working with densest $k$-tuples: for each $k=2,4,6$ there is only one densest pattern ${\cal H}$, while for each $k=3,5,7$ there are two densest patterns ${\cal H}$, with equal numerical values of functions $\varphi_{k}(q)$ and equal Hardy–Littlewood constants $C_{k}$.

3.1 The Growth Trend of Maximal Gaps

The vast majority of maximal gap sizes $G_{c}(x)$ are indeed observed near the trend curves predicted in Section 2.3. Specifically, for maximal gaps $G_{c}$ between primes $p=r+nq\in{\mathbb{P}}_{c}$ in $k$-tuples ($k\geq 2$), the gap sizes are mostly found in the neighborhood of the corresponding trend curves of Eqs. (12), (14) derived from extreme value theory. However, for $k=1$, the trend Eq. (33) gives a better prediction of maximal gaps $G_{q,r}$.

Figures 1–3 illustrate our numerical results for $k=1,2,6$, $q=313$. The horizontal axis in these figures is $\log^{k+1}{\negthinspace}p$ for end-of-gap primes $p$. Note that all gaps shown in the figures satisfy the generalized Cramér conjecture, i.e., inequalities (20), (34); for rare exceptions, see Section 3.5. Results for other values of $q$ look similar to Figures 1–3.

Numerical evidence suggests that

• •

For $k=1$ (the case of maximal gaps $G_{q,r}$ between primes $p=r+nq$) the EVT-based trend curve $\frac{\varphi(q)x}{\mathop{\mathrm{li}}x}\log\frac{\mathop{\mathrm{li}}x}{\varphi(q)}$ goes too high (Fig. 1, blue curve). Meanwhile, the trend (33)

[TABLE]

satisfactorily predicts gap sizes $G_{q,r}(x)$, with the empirical correction term

[TABLE]

where the parameter values

[TABLE]

are close to optimal for $q\in[10^{2},10^{5}]$ and $x\in[10^{7},10^{14}]$. Here the qualifier optimal is to be understood in conjunction with the rescaling transformation (47) introduced below in Section 3.2. A trend $T(q,x)$ is optimal if after transformation (47) the most probable rescaled values $w$ turn out to be near zero, and the mode of best-fit Gumbel distribution for $w$-values is also close to zero, $\mu\approx 0$; see Figure 4. In view of (45) it is possible that, for all $q$, the optimal term $b$ in (33) has the form $b(q,x)=(1+\beta(q,x))\cdot\log\varphi(q)\sim\log\varphi(q)$, where $\beta(q,x)$ very slowly decreases to zero as $x\to\infty$. (Note that in Section 2.3.2 we correctly estimated $b$ to be $O(\log q)$ but did not predict the appearance of Euler’s function $\varphi(q)$ in the term $b$.)

• •

For $k=2$, approximately half of maximal gaps $G_{c}$ between lesser twin primes $p\in{\mathbb{P}}_{c}$ are below the lower trend curve $T_{c}(x)$ of Equation (12), while the other half are above that curve; see Figure 2.

• •

For $k\geq 3$, more than half of maximal gaps $G_{c}$ are usually above the lower trend curve $T_{c}(x)$ of Equation (12). At the same time, more than half of maximal gaps are usually below the upper trend curve $\bar{T}_{c}(x)$ of Equation (14); see Figure 3. Recall that the two trend curves $T_{c}$ and $\bar{T}_{c}$ are within $k\bar{a}_{c}$ from each other as $x\to\infty$; see (17).

As noted by Brent brent2014 , twin primes seem to be more random than primes. We can add that, likewise, maximal gaps $G_{q,r}$ between primes in a residue class seem to be somewhat less random than those for prime $k$-tuples; primes $p\equiv r$ (mod $q$) do not go quite as far from each other as we would expect based on extreme value theory. Pintz pintz2007 discusses various other aspects of the “random” and not-so-random behavior of primes.

3.2 The Distribution of Maximal Gaps

In Section 3.1 we have tested equations that determine the growth trend of maximal gaps between primes in sequences ${\mathbb{P}}_{c}$. How are maximal gap sizes distributed in the neighborhood of their respective trend?

We will perform a rescaling transformation (motivated by extreme value theory): subtract the trend from the actual gap size, and then divide the result by a natural unit, the “local” average gap. This way each maximal gap size is mapped to its rescaled value:

[TABLE]

Gaps above the trend curve are mapped to positive rescaled values, while gaps below the trend curve are mapped to negative rescaled values.

Case $k=1$. For maximal gaps $G_{q,r}$ between primes $p\equiv r$ (mod $q$), the trend function $T$ is given by Equations (33), (45) and (46). The rescaling operation has the form

[TABLE]

where $a(q,x)=\displaystyle\frac{\varphi(q)x}{\mathop{\mathrm{li}}x}$. Figure 4 shows histograms of rescaled values $w$ for maximal gaps $G_{q,r}$ between primes $p\equiv r$ (mod $q$) for $q=16001$.

Case $k\geq 2$. For maximal gaps $G_{c}$ between prime $k$-tuples with $p=r+nq\in{\mathbb{P}}_{c}$, we can use the trend $T_{c}$ of Equation (12). Then the rescaling operation has the form

[TABLE]

where $a_{c}(x)$ is defined by (7). Figure 5 shows histograms of rescaled values $h$ for maximal gaps $G_{c}$ between lesser twin primes $p=r+nq\in{\mathbb{P}}_{c}$ for $q$ = 16001, $k=2$.

In both Figures 4 and 5, note that the histograms and fitting distributions are skewed to the right, i.e., the right tail is longer and heavier. Among two-parameter distributions, the Gumbel extreme value distribution is a very good fit; cf. kourbatov2014 ; liprattshakan . This was true in all our computational experiments.

{Remark}

For all histograms shown in Figures 4 and 5, the Kolmogorov–Smirnov goodness-of-fit statistic is less than 0.01; in fact, for most of the histograms, the goodness-of-fit statistic is about 0.003.

If we look at three-parameter distributions, then an excellent fit is the Generalized Extreme Value (GEV) distribution, which includes the Gumbel distribution as a special case. The shape parameter in the best-fit GEV distributions is close to zero; note that the Gumbel distribution is a GEV distribution whose shape parameter is exactly zero. So could the Gumbel distribution be the limit law for appropriately rescaled sequences of maximal gaps $G_{q,r}(p)$ and $G_{c}(p)$ as $p\to\infty$? Does such a limiting distribution exist at all?

The scale parameter $\alpha$. For $k=1$, we observed that the scale parameter of best-fit Gumbel distributions for $w$-values (47) was in the range $\alpha\in[0.7,1]$. The parameter $\alpha$ seems to slowly grow towards 1 as $p\to\infty$; see Figure 4. For $k\geq 2$, the scale parameter of best-fit Gumbel distributions for $h$-values (48) was usually a little over 1; see Figure 5. However, if instead of (48) we use the (simpler) rescaling transformation

[TABLE]

where $\bar{a}_{c}$ and $\bar{T}_{c}$ are defined, respectively, by (8) and (14), then the resulting Gumbel distributions of $\bar{h}$-values will typically have scales $\alpha$ a little below 1. In a similar experiment with random gaps, the scale was also close to 1; see (kourbatov2016, , Sect. 3.3).

3.3 Counting the Maximal Gaps

We used PARI/GP function findallgaps (see source code in Appendix A.2) to determine average numbers of maximal gaps $G_{q,r}$ between primes $p=r+nq$, $p\in[x,ex]$, for $x=e^{j}$, $j=1,2,\ldots,27$. Similar statistics were also gathered for gaps $G_{c}$. Figures 7–9 show the results of this computation for $q=16001$, $k\leq 4$. When $x$ is large, the average number of maximal gaps $G_{c}$ for $p\in[x,ex]$ indeed seems to very slowly approach $k+1$, as predicted by Equation (40). When $x$ is small ($x<q/e$), there is at most one prime $p\in[2,ex]$ in sequence ${\mathbb{P}}_{c}$—and often there are no such primes at all; accordingly, we see no gaps ending in $[x,ex]$, and the corresponding plot points in Figures 7–9 are zero.

Starting from some $x_{0}>q/e$, the gap counts in $[x,ex]$ are no longer zero. Here we observe a “transition region” in which the mean number of maximal gaps $G_{c}(p)$ for primes $p\in[x,ex]$ grows from 0 to a little over 1, while $x$ increases by about 3 orders of magnitude from $x_{0}$. The non-monotonic behavior of plot points in the transition region is explained, in part, by the fact that here the gap size may be comparable to the size of intervals $[x,ex]$. Then, for larger $x$, the typical number of gaps $G_{c}$ between $k$-tuples continues to slowly increase; specifically, the graph of $\mathop{\mathrm{mean}}(N_{c}(ex)-N_{c}(x))$ vs. $\log x$ is closely approximated by a hyperbola with horizontal asymptote $y=k+1$; see (40), (44) in Section 2.4.

Why do the observed curves resemble hyperbolas? If we were working with random gaps, then perhaps the curves could be explained using the theory of records; cf. krug2007 . But primes are not random numbers; and so we simply treat the hyperbolas in Figures 7–9 as an experimental fact.

3.4 How Long Do We Wait for the Next Maximal Gap?

Let $P(n)=\mbox{\href http://oeis.org/A002386}(n)$ and $P^{\prime}(n)=\mbox{\href http://oeis.org/A000101}(n)$ be the lower and upper endpoints of the $n$-th record (maximal) gap $R(n)$ between primes: $R(n)=\mbox{\href http://oeis.org/A005250}(n)=P^{\prime}(n)-P(n)$.

Consider the distances $P(n)-P(n-1)$ from one maximal gap to the next. (In statistics, a similar quantity is sometimes called “inter-record times”). In Figure 10 we present a plot of these distances; the figure also shows the corresponding plot for twin primes. As can be seen from Figure 10, the quantity $P(n)-P(n-1)$ grows approximately exponentially with $n$ (but not monotonically). Indeed, typical inter-record times are expected to satisfy222 The asymptotic equivalence $\sim$ in Eqs. (50) and (51) is a restatement of Eqs. (40) and (41). It would be logically unsound to suppose that $\log(P(n)-P(n-1))\stackrel{{\scriptstyle?}}{{\sim}}\log P(n)$ because we cannot exclude the possibility that $\log(P(n)-P(n-1))$ might (very rarely) become as small as $\log G(x)\approx 2\log\log x$, where $x=P(n)$.

[TABLE]

More generally, let $P_{c}(n)$ and $P^{\prime}_{c}(n)$ be the endpoints of the $n$-th maximal gap $R_{c}(n)$ between primes in sequence ${\mathbb{P}}_{c}$, where each prime is $r$ (mod $q$) and starts an admissible prime $k$-tuple. Then, in accordance with heuristic reasoning of Section 2.4, for typical inter-record times $P_{c}(n)-P_{c}(n-1)$ separating the maximal gaps $R_{c}(n-1)$ and $R_{c}(n)$ we expect to see

[TABLE]

In the special case $k=2$, that is, for maximal gaps between twin primes, the right-hand side of (51) is expected to be $\frac{n}{3}$ for large $n$ (whereas Figure 10 suggests the right-hand side $0.38n$ based on a very limited data set for $10\leq n\leq 75$). As we have seen in Section 3.3, the average number of maximal gaps between $k$-tuples occurring for primes $p\in[x,ex]$ slowly approaches $k+1$ from below. For moderate values of $x$ attainable in computation, this average is typically between 1 and $k+1$. Accordingly, we see that the right-hand side of (51) yields a prediction $\asymp e^{n/(k+1)}$ that underestimates the typical inter-record times and the primes $P_{c}(n)$. Computations may yield estimates

[TABLE]

where

[TABLE]

with the estimated value of $\beta$ depending on the range of available data.

{Remark}

Sample graphs of $\log P_{c}(n)$ vs. $n$ can be plotted online at the OEIS website: click graph and scroll to the logarithmic plot for sequences A002386 ($k=1$), A113275 ($k=2$), A201597 ($k=3$), A201599 ($k=3$), A229907 ($k=4$), A201063 ($k=5$), A201074 ($k=5$), A200504 ($k=6$). In all these graphs, when $n$ is large enough, $\log P_{c}(n)$ seems to grow approximately linearly with $n$. We conjecture that the slope of such a linear approximation slowly decreases, approaching the slope value $1/(k+1)$ as $n\to\infty$.

3.5 Exceptionally Large Gaps: $G_{q,r}(p)>\varphi(q)\log^{2}p$

Recall that for the maximal prime gaps $G(x)$ Shanks shanks conjectured the asymptotic equality $G(x)\sim\log^{2}x$, a strengthened form of Cramér’s conjecture. This seems to suggest that (unusually large) maximal gaps $g$ may in fact occur as early as at $x\asymp e^{\sqrt{g}}$. On the other hand, Wolf wolf1997 conjectured that typically a gap of size $d$ appears for the first time between primes near $\sqrt{d}\cdot e^{\sqrt{d}}$. Combining these observations, we may further observe that exceptionally large maximal gaps, that is,

[TABLE]

are also those which appear for the first time unusually early. Namely, they occur at $x$ roughly by a factor of $\sqrt{d}$ earlier than the typical first occurrence of a gap $d$ at $x\asymp\sqrt{d}\cdot e^{\sqrt{d}}$. Note that Granville (granville, , p. 24) suggests that gaps of unusually large size (52) occur infinitely often—and we will even see infinitely many of those exceeding $1.1229\log^{2}x$. In contrast, Sun (sun2013, , Conj. 2.3) made a conjecture implying that exceptions like (52) occur only finitely often, while Firoozbakht’s conjecture implies that exceptions (52) never occur for primes $p\geq 11$; see kourbatov2015u . Here we cautiously predict that exceptional gaps of size (52) are only a zero proportion of maximal gaps. This can be viewed as restatement of the generalized Cramér conjectures (20), (34) for the special case $k=1$, $q=2$.

Table 1 lists exceptionally large maximal gaps $G_{q,r}(p)$ between primes $p\equiv r$ (mod $q$) for which inequality (34) does not hold:

[TABLE]

Three sections of Table 1 correspond to (i) odd $q,r$; (ii) even $q$; (iii) even $r$. (Overlap between sections is due to the fact that $\varphi(q)=\varphi(2q)$ for odd $q$.) No other maximal gaps with this property were found for $p<10^{9}$, $q\leq 30000$. No such large gaps exist for $p<10^{10}$, $q\leq 1000$.

{Remark}

It is interesting that, for every gap listed in Table 1, at least one of the numbers $q$ and $r$ is composite. Thus far we have never seen a gap violating (34) with both $q$ and $r$ prime.

4 Summary

We have extensively studied record (maximal) gaps between prime $k$-tuples in residue classes (mod $q$). Our computational experiments described in Section 3 took months of computer time. Numerical evidence allows us to arrive at the following conclusions, which are also supported by heuristic reasoning.

• •

For $k=1$, the observed growth trend of maximal gaps $G_{q,r}(x)$ is given by (33) and (45). In particular, for maximal prime gaps ($k=1$, $q=2$) the trend equation reduces to

[TABLE]

• •

For $k\geq 2$, a significant proportion of maximal gaps $G_{c}(x)$ are observed between the trend curves of Equations (12) and (14), which can be heuristically derived from extreme value theory.

• •

The Gumbel distribution, after proper rescaling, is a possible limit law for $G_{q,r}(p)$ as well as $G_{c}(p)$. The existence of such a limiting distribution is an open question.

• •

Almost all maximal gaps $G_{q,r}(p)$ between primes in residue classes mod $q$ seem to satisfy appropriate generalizations of the Cramér and Shanks conjectures (34) and (35):

[TABLE]

• •

Similar generalizations (20) and (21) of the Cramér and Shanks conjectures are apparently true for almost all maximal gaps $G_{c}(p)$ between primes in ${\mathbb{P}}_{c}$:

[TABLE]

• •

Exceptionally large gaps $G_{q,r}(p)>\varphi(q)\log^{2}p$ are extremely rare (Table 1). We conjecture that only a zero proportion of maximal gaps are such exceptions. A similar observation holds for $G_{c}(p)$ violating (20).

• •

We conjecture that the total number $N_{q,r}(x)$ of maximal gaps $G_{q,r}$ observed up to $x$ is below $C\log x$ for some $C>2$.

• •

More generally, we conjecture: the number $N_{c}(x)$ of maximal gaps between primes in ${\mathbb{P}}_{c}$ up to $x$ satisfies the inequality $N_{c}(x)<C\log x$ for some $C>k+1$, where $k$ is the number of integers in the pattern ${\cal H}$ defining the sequence ${\mathbb{P}}_{c}$.

Acknowledgements.

We are grateful to the anonymous referees for useful suggestions. Thanks also to all contributors and editors of the websites OEIS.org and PrimePuzzles.net. \appendixtitlesyes

Appendix A Details of Computational Experiments

Interested readers can reproduce and extend our results using the programs below.

A.1 PARI/GP Program maxgap.gp

default(realprecision,11) outpath = "c:\wgap"

\ maxgap(q,r,end [,b0,b1,b2]) ver 2.1 computes maximal gaps g \ between primes p = qn + r, as well as rescaled values (w, u, h): \ w - as in eqs.(33),(45)-(47) of arXiv:1901.03785 (this paper); \ u - same as w, but with constant b = ln phi(q); \ h - based on extreme value theory (cf. randomgap.gp in arXiv:1610.03340) \ Results are written on screen and in the folder specified by outpath string. \ Computation ends when primes exceed the end parameter. maxgap(q,r,end,b0=1,b1=4,b2=2.7) = { re = 0; p = pmin(q,r); t = eulerphi(q); inc = q; while(p<end, m = p + re; p = m + inc; while(!isprime(p), p+=inc); while(!isprime(m), m-=inc); g = p - m; if(g>re, re=g; Lip=li(p); a=tp/Lip; Logp=log(p); h = g/a-log(Lip/t); u = g/a-2log(Lip/t)+Logp-log(t); w = g/a-2log(Lip/t)+Logp-log(t)(b0+b1/max(2,log(Logp))^b2); f = ceil(Logp/log(10)); write(outpath"\"q"_1e"f".txt", w" "u" "h" "g" "m" "p" q="q" r="r); print(w" "u" "h" "g" "m" "p" q="q" r="r); if(g/t>log(p)^2, write(outpath"\"q"_1e"f".txt","extra large")); if(g%2==0, inc=lcm(2,q));

  \\ optional part: statistics for p in intervals [x/e,ex] for x=e^j
  i = ceil(Logp);
  j = floor(Logp);
  if(N!=’N,N[j]++);  \\ count maxima with p in [x,ex] for x=e^j
  write(outpath"\\"q"_exp"i".txt", w" "u" "h" "g" "m" "p" q="q" r="r);
  write(outpath"\\"q"_exp"j".txt", w" "u" "h" "g" "m" "p" q="q" r="r);
)

) }

A.2 PARI/GP: Auxiliary Functions for maxgap.gp

\ These functions are intended for use with the program maxgap.gp \ It is best to include them in the same file with maxgap.gp

\ li(x) computes the logarithmic integral of x li(x) = real(-eint1(-log(x)))

\ pmin(q,r) computes the least prime p = qn + r, for n=0,1,2,3,... pmin(q,r) = forstep(p=r,1e99,q, if(isprime(p), return(p)))

\ findallgaps(q,end): Given q, call maxgap(q,r,end) for all r coprime to q. \ Output total and average counts of maximal gaps in intervals [x,ex]. findallgaps(q,end) = { t = eulerphi(q); N = vector(99,j,0); for(r=1,q, if(gcd(q,r)==1,maxgap(q,r,end))); nmax = floor(log(end)); for (n=1,nmax, avg = 1.0*N[n]/t; write(outpath"\"q"stats.txt", n" "avg" "N[n]); ) }

A.3 Notes on Distribution Fitting

In order to study distributions of rescaled maximal gaps, we used the distribution-fitting software EasyFit easyfit . Data files created with maxgap.gp are easily imported into EasyFit:

From the File menu, choose Open. 2. 2.

Select the data file. 3. 3.

Specify Field Delimiter = space. 4. 4.

Click Update, then OK.

Caution: PARI/GP outputs large and small real numbers in a mantissa-exponent format with a space preceding the exponent (e.g., 1.7874829515 E-5), whereas EasyFit expects such numbers without a space (e.g., 1.7874829515E-5). Therefore, before importing into EasyFit, search the data files for " E" and replace all occurrences with "E".

Appendix B The Hardy–Littlewood Constants $C_{k,{\cal H}}$

The Hardy–Littlewood $k$-tuple conjecture hl1923 allows one to predict the average frequencies of prime $k$-tuples near $p$, as well as the approximate total counts of prime $k$-tuples below $x$. Specifically, the Hardy–Littlewood $k$-tuple constants $C_{k,{\cal H}}$, divided by $\log^{k}p$, give us an estimate of the average frequency of prime $k$-tuples near $p$:

[TABLE]

Accordingly (riesel, , pp. 61–68), for a given $k$-tuple pattern ${\cal H}$, the total count of $k$-tuples below $x$ is

[TABLE]

The Hardy–Littlewood constants $C_{k,{\cal H}}$ can be defined in terms of infinite products over primes. In particular, for densest admissible prime $k$-tuples with $k\leq 7$ we have:

[TABLE]

Forbes forbes gives values of the Hardy–Littlewood constants up to $k=24$, albeit with fewer significant digits; see also (finch, , p. 86). Starting from $k=8$, we may often encounter more than one numerical value of $C_{k,{\cal H}}$ for a single $k$. (If there are $m$ different patterns ${\cal H}$ of densest admissible prime $k$-tuples for the same $k$, then we typically have $\lceil{m\over 2}\rceil$ different numerical values of $C_{k,{\cal H}}$, depending on the actual pattern ${\cal H}$ of the $k$-tuple; see forbes .)

Appendix C Integrals ${\mathop{\mathrm{Li}}}_{k}(x)$

Let $k\in{\mathbb{N}}$ and $x>1$, and let

[TABLE]

Denote by $\mathop{\mathrm{li}}x$ the conventional logarithmic integral (principal value):

[TABLE]

In PARI/GP, an easy way to compute $\mathop{\mathrm{li}}x$ is as follows:  li(x) = real(-eint1(-log(x))).

The integrals $F_{k}(x)$ and ${\mathop{\mathrm{Li}}}_{k}(x)=F_{k}(x)-F_{k}(2)$ can also be expressed in terms of $\mathop{\mathrm{li}}x$. Integration by parts gives

[TABLE]

Therefore,

[TABLE]

and, in general,

[TABLE]

Using these formulas we can compute ${\mathop{\mathrm{Li}}}_{k}(x)$ for approximating $\pi_{c}(x)$ (the prime counting function for sequence ${\mathbb{P}}_{c}$) in accordance with the $k$-tuple equidistribution conjecture (6):

[TABLE]

The values of $\mathop{\mathrm{li}}x$, and hence $\mathop{\mathrm{Li}}_{k}(x)$, can be calculated without (numerical) integration. For example, one can use the following rapidly converging series for $\mathop{\mathrm{li}}x$, with $n!$ in the denominator and $\log^{n}x$ in the numerator (see Prudnikov-et-al-I , formulas 1.6.1.8–9):

[TABLE]

\reftitle

References