Eighteen primes in arithmetic progression
HTML articles powered by AMS MathViewer
- by Paul A. Pritchard PDF
- Math. Comp. 41 (1983), 697 Request permission
Abstract:
There is an arithmetic progression of 18 primes, viz. $107928278317 + k \cdot 9922782870$, $k = 0,1, \ldots ,17$.References
- G. H. Hardy and J. E. Littlewood, Some problems of ‘Partitio numerorum’; III: On the expression of a number as a sum of primes, Acta Math. 44 (1923), no. 1, 1–70. MR 1555183, DOI 10.1007/BF02403921
- 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. MR 730934, DOI 10.1016/0167-6423(83)90003-5
- Sol Weintraub, Seventeen primes in arithmetic progression, Math. Comp. 31 (1977), no. 140, 1030. MR 441849, DOI 10.1090/S0025-5718-1977-0441849-4
Additional Information
- © Copyright 1983 American Mathematical Society
- Journal: Math. Comp. 41 (1983), 697
- MSC: Primary 11Y55; Secondary 11B25
- DOI: https://doi.org/10.1090/S0025-5718-1983-0717714-4
- MathSciNet review: 717714