Seven consecutive primes in arithmetic progression

From MaRDI portal





Whether there are arbitrarily long runs of primes in arithmetic progressions is an open problem, and \textit{P. A. Pritchard, A. Moran} and \textit{A. Thyssen} [Math. Comput. 64, 1337-1339 (1995; Zbl 0830.11002)] recently found a run of 22 such primes. Earlier \textit{L. J. Lander} and \textit{T. R. Parkin} [Math. Comput. 21, 489 (1967; Zbl 0149.29002)] found that \(p=121174811\) is the smallest number such that \(p+30k\) are consecutive primes for \(0\leq k<6\). The authors have now found a 97 digit number \(p\) such that \(p+210k\) are consecutive primes for \(0\leq k<7\). The requirement for such primes to be consecutive amounts essentially to the search for 7 primes together with a prescribed set of \(6{\times}209=1254\) composite numbers between the first and the last of these primes. A system of simultaneous congruences has to be set up so that the solution delivers a potentially good starting point for the 7 primes. There is much flexibility in the scheme, which also includes primality tests for probable primes. For 8, 9 or 10 such primes, the cardinals of the corresponding sets of prescribed composite numbers are 1463, 1672 and 1881, respectively, and the authors believe that, when implemented on large machines and PC networks, the method can also cope with these cases. However, a run of 11 such primes will require a prescribed set of \(10{\times}2309=23090\) composite numbers. Meanwhile, \textit{D. K. L. Shiu} [J. Lond. Math. Soc. (to appear)] has proved that there are arbitrarily long runs of consecutive primes in any residue class \(a\) (mod \(q\)) when \((a,q)=1\).











This page was built for publication: Seven consecutive primes in arithmetic progression

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4372650)