![]() |
|||
| ISSN 1088-6842(e) ISSN 0025-5718(p) | |||
|
Ten consecutive primes in arithmetic progression
Author(s):
H.
Dubner;
T.
Forbes;
N.
Lygeros;
M.
Mizony;
H.
Nelson;
P.
Zimmermann.
Abstract | References | Similar articles | Additional information Abstract: In 1967 the first set of 6 consecutive primes in arithmetic progression was found. In 1995 the first set of 7 consecutive primes in arithmetic progression was found. Between November, 1997 and March, 1998, we succeeded in finding sets of 8, 9 and 10 consecutive primes in arithmetic progression. This was made possible because of the increase in computer capability and availability, and the ability to obtain computational help via the Internet. Although it is conjectured that there exist arbitrarily long sequences of consecutive primes in arithmetic progression, it is very likely that 10 primes will remain the record for a long time.
Retrieve articles in Mathematics of Computation with MSC (2000): 11N13 Retrieve articles in all Journals with MSC (2000): 11N13
H.
Dubner
T.
Forbes
N.
Lygeros
M.
Mizony
H.
Nelson
P.
Zimmermann
|
|
|
|||
|
© Copyright 2008, American Mathematical Society Privacy Statement |
Search the AMS |
||