## You are here

HomeCunningham chain

## Primary tabs

# Cunningham chain

When, in a sequence of primes $p_{1},\ldots p_{k}$ each $p_{n}=2p_{{n-1}}+1$ for $1<n\leq k$ (or alternatively, each $p_{n}={{p_{{n-1}}-1}\over 2}$ for $0<n<k$), the sequence is called a Cunningham chain of the first kind. In a Cunningham chain of the first kind, all primes except the largest are Sophie Germain primes, while all primes except the smallest are safe primes. The primes in a Cunningham chain are related to the Mersenne numbers thus: $p_{n}\equiv 2^{n}-1\mod 2^{n}$, where $n$ is the prime’s position in the Cunningham chain (except in the case of the chain starting with 2, which is a special case).

In a Cunningham chain of the second kind, the relation among primes is $2p_{{n-1}}-1$. An example of a Cunningham chain of the second kind is 1531, 3061, 6121, 12241, 24481.

It is strongly believed that there are infinitely many Cunningham chains of either kind, but this remains to be proven.

External links

## Mathematics Subject Classification

11N05*no label found*

- Forums
- Planetary Bugs
- HS/Secondary
- University/Tertiary
- Graduate/Advanced
- Industry/Practice
- Research Topics
- LaTeX help
- Math Comptetitions
- Math History
- Math Humor
- PlanetMath Comments
- PlanetMath System Updates and News
- PlanetMath help
- PlanetMath.ORG
- Strategic Communications Development
- The Math Pub
- Testing messages (ignore)

- Other useful stuff
- Corrections