
Glossary: Prime Pages: Top 5000: 
The hardware and software on this system was updated September 4th.
Please let me know of any problem you encounter.
<caldwell@utm.edu> An arithmetic sequence (or arithmetic progression) is a sequence (finite or infinite list) of real numbers for which each term is the previous term plus a constant (called the common difference). For example, starting with 1 and using a common difference of 4 we get the finite arithmetic sequence: 1, 5, 9, 13, 17, 21; and also the inifinite sequence 1, 5, 9, 13, 17, 21, 25, 29, . . ., 4n+1, . . .In general, the terms of an arithmetic sequence with the first term a_{0} and common difference d, have the form a_{n} = dn+a_{0} (n=0,1,2,...). If a_{0} and d are relatively prime positive integers, then the corresponding infinite sequence contains infinitely many primes (see Dirichlet's theorem on primes in arithmetic progressions). An important example of this is the following two arithmetic sequences: 1, 7, 13, 19, 25, 31, 37, ...Together these two sequences contain all of the primes except 2 and 3. A related question is how long of a arithmetic sequence can we find all of whose members are prime. Dickson's conjecture says the answer should be arbitrarily longbut finding long sequences of primes is quite difficult. It is fairly easy to heuristically estimate how many such primes sequences there should be for any given lengthHardy and Littlewood first did this in 1922 [HL23]. In 1939, van der Corput showed that there are infinitely many triples of primes in arithmetic progression [Corput1939]. Finally, in 2004, Green and Tao [GT2004a] showed that there are indeed arbitrarily long sequences of primes and that a kterm one occurs before [GT2004b]: 2^{2222222100k}Obviously this is not optimal! It is conjectured that it actually occurs before k!+1 [Kra2005]. The longest known arithmetic sequence of primes is currently of length 25, starting with the prime 6171054912832631 and continuing with common difference 366384*23#*n, found by Chermoni Raanan and Jaroslaw Wroblewski in May 2008. The longest known sequence of consecutive primes in arithmetic progression is ten starting with the 93digit prime 100 9969724697 1424763778 6655587969 8403295093 2468919004 1803603417 7589043417 0334888215 9067229719,and continuing with common difference 210. (See Tony Forbes' web page for more information.) In August 2000 David Broadhurst found the smallest arithmetic progression of titanic primes of length three: 10^{999}+61971, 10^{999}+91737, 10^{999}+121503;and of length four: 10^{999}+2059323, 10^{999}+2139213, 10^{999}+2219103, 10^{999}+2298993.
See Also: GeometricSequence Related pages (outside of this work)
References:
Chris K. Caldwell © 19992014 (all rights reserved)
