Article Dans Une Revue
Mathematics of Computation
Année : 2002
Résumé
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 availabiblity, 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.
Publications Loria : Connectez-vous pour contacter le contributeur
https://inria.hal.science/inria-00100978
Soumis le : mardi 26 septembre 2006-14:53:17
Dernière modification le : mardi 8 octobre 2024-16:00:17
Dates et versions
- HAL Id : inria-00100978 , version 1
Citer
Harvey Dubner, Tony Forbes, Nik Lygeros, Michel Mizony, Harry Nelson, et al.. Ten Consecutive Primes In Arithmetic Progression. Mathematics of Computation, 2002, 71 (239), pp.1323-1328. ⟨inria-00100978⟩
Collections
589
Consultations
0
Téléchargements