Seven consecutive primes in arithmetic progression
Open Access
- 1 October 1997
- journal article
- Published by American Mathematical Society (AMS) in Mathematics of Computation
- Vol. 66 (220) , 1743-1749
Abstract
It is conjectured that there exist arbitrarily long sequences of consecutive primes in arithmetic progression. In 1967, the first such sequence of 6 consecutive primes in arithmetic progression was found. Searching for 7 consecutive primes in arithmetic progression is difficult because it is necessary that a prescribed set of at least 1254 numbers between the first and last prime all be composite. This article describes the search theory and methods, and lists the only known example of 7 consecutive primes in arithmetic progression.Keywords
This publication has 6 references indexed in Scilit:
- Large Sophie Germain primesMathematics of Computation, 1996
- Twenty-Two Primes in Arithmetic ProgressionMathematics of Computation, 1995
- Unsolved Problems in Number Theory1994
- The Book of Prime Number Records1989
- Unsolved problems in number theory, by R. K. Guy. Pp 161. DM 42. 1981. ISBN 3-540-90593-6 (Springer)The Mathematical Gazette, 1982
- Consecutive Primes in Arithmetic ProgressionMathematics of Computation, 1967