Remote Access Mathematics of Computation
Green Open Access

Mathematics of Computation

ISSN 1088-6842(online) ISSN 0025-5718(print)



Eighteen primes in arithmetic progression

Author: Paul A. Pritchard
Journal: Math. Comp. 41 (1983), 697
MSC: Primary 11Y55; Secondary 11B25
MathSciNet review: 717714
Full-text PDF Free Access

Abstract | References | Similar Articles | Additional Information

Abstract: There is an arithmetic progression of 18 primes, viz. $ 107928278317 + k \cdot 9922782870$, $ k = 0,1, \ldots ,17$.

References [Enhancements On Off] (What's this?)

  • [1] G. H. Hardy & J. E. Littlewood, "Some problems of 'partitio numerorum' III: on the expression of a number as a sum of primes," Acta Math., v. 44, 1923, pp. 1-70. MR 1555183
  • [2] P. Pritchard, "A case study of number-theoretic computation: searching for primes in arithmetic progression," Sci. Comput. Programming. (To appear.) MR 730934 (85g:11119)
  • [3] S. Weintraub, "Seventeen primes in arithmetic progression," Math. Comp., v. 31, 1977, p. 1030. MR 0441849 (56:240)

Similar Articles

Retrieve articles in Mathematics of Computation with MSC: 11Y55, 11B25

Retrieve articles in all journals with MSC: 11Y55, 11B25

Additional Information

Article copyright: © Copyright 1983 American Mathematical Society

American Mathematical Society