![]() |
|||
| ISSN 1088-6842(e) ISSN 0025-5718(p) | |||
|
Seven consecutive primes in arithmetic progression
Author(s):
Harvey
Dubner;
Harry
Nelson.
Abstract | References | Similar articles | Additional information 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.
Retrieve articles in Mathematics of Computation with MSC (1991): 11N13 Retrieve articles in all Journals with MSC (1991): 11N13
Harvey
Dubner
Harry
Nelson
|
|
|
|||
|
© Copyright 2009, American Mathematical Society Privacy Statement |
Search the AMS |
||