×

Twenty-two primes in arithmetic progression. (English) Zbl 0830.11002

Summary: Some newly-discovered arithmetic progressions of primes are presented, including five of length twenty-one and one of length twenty-two.

MSC:

11-04 Software, source code, etc. for problems pertaining to number theory
11Y11 Primality
11A41 Primes
11N13 Primes in congruence classes
PDFBibTeX XMLCite
Full Text: DOI

References:

[1] Emil Grosswald, Arithmetic progressions that consist only of primes, J. Number Theory 14 (1982), no. 1, 9 – 31. · Zbl 0478.10034 · doi:10.1016/0022-314X(82)90055-5
[2] Richard K. Guy, Unsolved problems in number theory, Unsolved Problems in Intuitive Mathematics, vol. 1, Springer-Verlag, New York-Berlin, 1981. Problem Books in Mathematics. · Zbl 0474.10001
[3] Richard K. Guy, Canadian Number Theory Association unsolved problems 1988, Number theory (Banff, AB, 1988) de Gruyter, Berlin, 1990, pp. 193 – 206. · Zbl 0692.10001
[4] A. Moran and P. A. Pritchard, The design of a background job on a local-area network, Proceedings 14th Australian Computer Science Conference , Australian Computer Science Communications 13 (1991), 17-1-17-11.
[5] Paul A. Pritchard, A case study of number-theoretic computation: searching for primes in arithmetic progression, Sci. Comput. Programming 3 (1983), no. 1, 37 – 63. · Zbl 0521.10002 · doi:10.1016/0167-6423(83)90003-5
[6] Paul A. Pritchard, Long arithmetic progressions of primes: some old, some new, Math. Comp. 45 (1985), no. 171, 263 – 267. · Zbl 0574.10002
This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. In some cases that data have been complemented/enhanced by data from zbMATH Open. This attempts to reflect the references listed in the original paper as accurately as possible without claiming completeness or a perfect matching.