Wiki
Wiki

Research notes on every problem, and a library of the papers behind them. Built from the open erdos repository.

Updated


Statement

Corollary 3 (p. 3). Let aa and D≥3D\ge3 be coprime integers. For every m≥2m\ge2 there are infinitely many r∈Nr\in\mathbb N such that

pr+1≡pr+2≡⋯≡pr+m≡a mod Dp_{r+1}\equiv p_{r+2}\equiv\cdots\equiv p_{r+m}\equiv a \bmod D

and pr+m−pr+1≤DCmp_{r+m}-p_{r+1}\le DC_m, where CmC_m is a constant depending only on mm. Here pnp_n is the nn-th smallest prime.

The paper notes (p. 3) that Shiu proved the result without the constraint pr+m−pr+1≤DCmp_{r+m}-p_{r+1}\le DC_m, and that Shiu attributes to Chowla the conjecture that infinitely many pairs of consecutive primes pr,pr+1p_r,p_{r+1} lie in the class a mod Da \bmod D.

Proof pointer

P. 5. Take k≥kmk\ge k_m and any admissible {x+aj}j=1k\{x+a_j\}_{j=1}^k with a1<⋯<aka_1<\cdots<a_k, and put bj=Daj+ab_j=Da_j+a; then {x+bj}j=1k\{x+b_j\}_{j=1}^k is admissible and gcd⁡(D,bj)=1\gcd(D,b_j)=1. Theorem 1 with g=Dg=D gives mm consecutive primes Dn+hiDn+h_i for infinitely many nn; they are all ≡a mod D\equiv a \bmod D and lie in an interval of length bk−b1=D(ak−a1)b_k-b_1=D(a_k-a_1).

Read depth

Claims checked: Corollary 3 and the remark on Shiu's theorem were read clause by clause on the page images of the arXiv print, and the proof on p. 5 was followed. It rests on Theorem 1 and through it on the Maynard-Tao theorem, which the paper cites. Nothing here is independently reviewed.

Dependencies

  • Theorem 1 of this paper, applied with g=Dg=D.

Source. W. D. Banks, T. Freiberg and C. L. Turnage-Butterbaugh, Consecutive primes in tuples, Acta Arith. 167 (2015), no. 3, 261-266, doi:10.4064/aa167-3-4, arXiv:1311.7003; the edition read and its page numbering are named on the source card.

Bears on

No Erdős problem in the corpus is recorded as concerning this corollary.