|
|
|
Glossary:
Prime Pages:
Top 5000:
|
Recall that a Sophie Germain prime is a prime p such that
q=2p+1 is also prime. Why not also ask that
r=2q+1 is prime, and 2r+1 is prime, and...?
A Cunningham chain of length k (of the first kind)
is sequence of k primes, each which is twice the preceding
one plus one. For example, {2, 5, 11, 23, 47} and {89, 179, 359, 719, 1439, 2879}.
A Cunningham chain of length k (of the second kind) is a sequence of k primes, each which is twice the preceding one minus one. (For example, {2, 3, 5} and {1531, 3061, 6121, 12241, 24481}.) Primes of both these forms are called complete chains if they can not be extended by adding either the next larger, or smaller, terms. In the following table (from [Loh89]) we list the first complete chains for several lengths.
How long can these chains get? The prime k-tuple conjecture implies that there should be infinitely many for each of these primes. In fact, the the number less than x should be asymptotic to where The sequence Bk begins approximately 1.32032 (k=2), 2.85825, 5.553491, 20.2636, 71.9622, 233.878, 677.356. Tony Forbes has found chains of length 14 (for the first kind) and 16 (for the second kind). See the links below for current records. Note that some authors extend the definition of Cunningham Chain to all sequences of primes pi the form pi+1 = api+b where a and b are fixed, relatively prime integers with a > 1.
Related pages (outside of this work)
References:
Chris Caldwell © 1999-2009 (all rights reserved)
|