Cunningham chain

Last updated

In mathematics, a Cunningham chain is a certain sequence of prime numbers. Cunningham chains are named after mathematician A. J. C. Cunningham. They are also called chains of nearly doubled primes.

Contents

Definition

A Cunningham chain of the first kind of length n is a sequence of prime numbers (p1, ..., pn) such that pi+1 = 2pi + 1 for all 1  i < n. (Hence each term of such a chain except the last is a Sophie Germain prime, and each term except the first is a safe prime).

It follows that

or, by setting (the number is not part of the sequence and need not be a prime number), we have

Similarly, a Cunningham chain of the second kind of length n is a sequence of prime numbers (p1, ..., pn) such that pi+1 = 2pi  1 for all 1  i < n.

It follows that the general term is

Now, by setting , we have .

Cunningham chains are also sometimes generalized to sequences of prime numbers (p1, ..., pn) such that pi+1 = api + b for all 1  i  n for fixed coprime integers a and b; the resulting chains are called generalized Cunningham chains.

A Cunningham chain is called complete if it cannot be further extended, i.e., if the previous and the next terms in the chain are not prime numbers.

Examples

Examples of complete Cunningham chains of the first kind include these:

2, 5,11, 23, 47 (The next number would be 95, but that is not prime.)
3, 7 (The next number would be 15, but that is not prime.)
29, 59 (The next number would be 119, but that is not prime.)
41, 83, 167 (The next number would be 335, but that is not prime.)
89, 179, 359, 719, 1439, 2879 (The next number would be 5759, but that is not prime.)

Examples of complete Cunningham chains of the second kind include these:

2, 3, 5 (The next number would be 9, but that is not prime.)
7, 13 (The next number would be 25, but that is not prime.)
19, 37, 73 (The next number would be 145, but that is not prime.)
31, 61 (The next number would be 121 = 112, but that is not prime.)

Cunningham chains are now considered useful in cryptographic systems since "they provide two concurrent suitable settings for the ElGamal cryptosystem ... [which] can be implemented in any field where the discrete logarithm problem is difficult." [1]

Largest known Cunningham chains

It follows from Dickson's conjecture and the broader Schinzel's hypothesis H, both widely believed to be true, that for every k there are infinitely many Cunningham chains of length k. There are, however, no known direct methods of generating such chains.

There are computing competitions for the longest Cunningham chain or for the one built up of the largest primes, but unlike the breakthrough of Ben J. Green and Terence Tao – the Green–Tao theorem, that there are arithmetic progressions of primes of arbitrary length – there is no general result known on large Cunningham chains to date.

Largest known Cunningham chain of length k (as of 29 January 2025 [2] )
kKindp1 (starting prime)DigitsYearDiscoverer
11st / 2nd2136279841 − 1410243202024Luke Durant, GIMPS
21st2618163402417×21290000 − 13883422016 PrimeGrid
2nd213778324725×2561417 + 11690152023Ryan Propper & Serge Batalov
31st1128330746865×266439 − 1200132020Michael Paridon
2nd214923707595×249073 + 1147842025Serge Batalov
41st13720852541×7877# − 133842016Michael Angel & Dirk Augustin
2nd49325406476×9811# + 142342019Oscar Östlin
51st475676794046977267×4679# − 120192024Andrey Balyakin
2nd181439827616655015936×4673# + 120182016Andrey Balyakin
61st2799873605326×2371# - 110162015Serge Batalov
2nd37015322207094×2339# + 110012025Serge Batalov
71st82466536397303904×1171# − 15092016Andrey Balyakin
2nd25802590081726373888×1033# + 14532015Andrey Balyakin
81st89628063633698570895360×593# − 12652015Andrey Balyakin
2nd2373007846680317952×761# + 13372016Andrey Balyakin
91st553374939996823808×593# − 12602016Andrey Balyakin
2nd173129832252242394185728×401# + 11872015Andrey Balyakin
101st3696772637099483023015936×311# − 11502016Andrey Balyakin
2nd2044300700000658875613184×311# + 11502016Andrey Balyakin
111st73853903764168979088206401473739410396455001112581722569026969860983656346568919×151# − 11402013Primecoin (block 95569)
2nd341841671431409652891648×311# + 11492016Andrey Balyakin
121st288320466650346626888267818984974462085357412586437032687304004479168536445314040×83# − 11132014Primecoin (block 558800)
2nd906644189971753846618980352×233# + 11212015Andrey Balyakin
131st106680560818292299253267832484567360951928953599522278361651385665522443588804123392×61# − 11072014Primecoin (block 368051)
2nd38249410745534076442242419351233801191635692835712219264661912943040353398995076864×47# + 11012014Primecoin (block 539977)
141st4631673892190914134588763508558377441004250662630975370524984655678678526944768×47# − 1972018Primecoin (block 2659167)
2nd5819411283298069803200936040662511327268486153212216998535044251830806354124236416×47# + 11002014Primecoin (block 547276)
151st14354792166345299956567113728×43# - 1452016Andrey Balyakin
2nd67040002730422542592×53# + 1402016Andrey Balyakin
161st91304653283578934559359232008Jaroslaw Wroblewski
2nd2×1540797425367761006138858881 − 1282014Chermoni & Wroblewski
171st2759832934171386593519222008Jaroslaw Wroblewski
2nd1540797425367761006138858881282014Chermoni & Wroblewski
182nd658189097608811942204322721272014Chermoni & Wroblewski
192nd79910197721667870187016101262014Chermoni & Wroblewski

q# denotes the primorial 2×3×5×7×...×q.

As of 2018, the longest known Cunningham chain of either kind is of length 19, discovered by Jaroslaw Wroblewski in 2014. [2]

Congruences of Cunningham chains

Let the odd prime be the first prime of a Cunningham chain of the first kind. The first prime is odd, thus . Since each successive prime in the chain is it follows that . Thus, , , and so forth.

The above property can be informally observed by considering the primes of a chain in base 2. (Note that, as with all bases, multiplying by the base "shifts" the digits to the left; e.g. in decimal we have 314×10 = 3140.) When we consider   in base 2, we see that, by multiplying   by 2, the least significant digit of   becomes the secondmost least significant digit of  . Because is odd—that is, the least significant digit is 1 in base 2–we know that the secondmost least significant digit of   is also 1. And, finally, we can see that   will be odd due to the addition of 1 to . In this way, successive primes in a Cunningham chain are essentially shifted left in binary with ones filling in the least significant digits. For example, here is a complete length 6 chain which starts at 141361469:

BinaryDecimal
1000011011010000000100111101141361469
10000110110100000001001111011282722939
100001101101000000010011110111565445879
10000110110100000001001111011111130891759
100001101101000000010011110111112261783519
1000011011010000000100111101111114523567039

A similar result holds for Cunningham chains of the second kind. From the observation that and the relation it follows that . In binary notation, the primes in a Cunningham chain of the second kind end with a pattern "0...01", where, for each , the number of zeros in the pattern for is one more than the number of zeros for . As with Cunningham chains of the first kind, the bits left of the pattern shift left by one position with each successive prime.

Similarly, because it follows that . But, by Fermat's little theorem, , so divides (i.e. with ). Thus, no Cunningham chain can be of infinite length. [3]

See also

Related Research Articles

In number theory, the Legendre symbol is a multiplicative function with values 1, −1, 0 that is a quadratic character modulo of an odd prime number p: its value at a (nonzero) quadratic residue mod p is 1 and at a non-quadratic residue (non-residue) is −1. Its value at zero is 0.

In number theory, Fermat's little theorem states that if p is a prime number, then for any integer a, the number apa is an integer multiple of p. In the notation of modular arithmetic, this is expressed as

This article collects together a variety of proofs of Fermat's little theorem, which states that

The Fermat primality test is a probabilistic test to determine whether a number is a probable prime.

In number theory, a probable prime (PRP) is an integer that satisfies a specific condition that is satisfied by all prime numbers, but which is not satisfied by most composite numbers. Different types of probable primes have different specific conditions. While there may be probable primes that are composite, the condition is generally chosen in order to make such exceptions rare.

In modular arithmetic, a number g is a primitive root modulo n if every number a coprime to n is congruent to a power of g modulo n. That is, g is a primitive root modulo n if for every integer a coprime to n, there is some integer k for which gka. Such a value k is called the index or discrete logarithm of a to the base g modulo n. So g is a primitive root modulo n if and only if g is a generator of the multiplicative group of integers modulo n.

In algebra and number theory, Wilson's theorem states that a natural number n > 1 is a prime number if and only if the product of all the positive integers less than n is one less than a multiple of n. That is, the factorial satisfies

In number theory, a Wieferich prime is a prime number p such that p2 divides 2p − 1 − 1, therefore connecting these primes with Fermat's little theorem, which states that every odd prime p divides 2p − 1 − 1. Wieferich primes were first described by Arthur Wieferich in 1909 in works pertaining to Fermat's Last Theorem, at which time both of Fermat's theorems were already well known to mathematicians.

In number theory, a Wall–Sun–Sun prime or Fibonacci–Wieferich prime is a certain kind of prime number which is conjectured to exist, although none are known.

In mathematics, the Lucas–Lehmer test (LLT) is a primality test for Mersenne numbers. The test was originally developed by Édouard Lucas in 1878 and subsequently proved by Derrick Henry Lehmer in 1930.

In computational number theory, the Lucas test is a primality test for a natural number n; it requires that the prime factors of n − 1 be already known. It is the basis of the Pratt certificate that gives a concise verification that n is prime.

The quadratic sieve algorithm (QS) is an integer factorization algorithm and, in practice, the second-fastest method known. It is still the fastest for integers under 100 decimal digits or so, and is considerably simpler than the number field sieve. It is a general-purpose factorization algorithm, meaning that its running time depends solely on the size of the integer to be factored, and not on special structure or properties. It was invented by Carl Pomerance in 1981 as an improvement to Schroeppel's linear sieve.

A divisibility rule is a shorthand and useful way of determining whether a given integer is divisible by a fixed divisor without performing the division, usually by examining its digits. Although there are divisibility tests for numbers in any radix, or base, and they are all different, this article presents rules and examples only for decimal, or base 10, numbers. Martin Gardner explained and popularized these rules in his September 1962 "Mathematical Games" column in Scientific American.

In number theory the Agoh–Giuga conjecture on the Bernoulli numbers Bk postulates that p is a prime number if and only if

A strong pseudoprime is a composite number that passes the Miller–Rabin primality test. All prime numbers pass this test, but a small fraction of composites also pass, making them "pseudoprimes".

In mathematics, Wolstenholme's theorem states that for a prime number p ≥ 5, the congruence

<span class="mw-page-title-main">Carmichael function</span> Function in mathematical number theory

In number theory, a branch of mathematics, the Carmichael functionλ(n) of a positive integer n is the smallest positive integer m such that

In additive number theory, Fermat's theorem on sums of two squares states that an odd prime p can be expressed as:

The digital root of a natural number in a given radix is the value obtained by an iterative process of summing digits, on each iteration using the result from the previous iteration to compute a digit sum. The process continues until a single-digit number is reached. For example, in base 10, the digital root of the number 12345 is 6 because the sum of the digits in the number is 1 + 2 + 3 + 4 + 5 = 15, then the addition process is repeated again for the resulting number 15, so that the sum of 1 + 5 equals 6, which is the digital root of that number. In base 10, this is equivalent to taking the remainder upon division by 9, which allows it to be used as a divisibility rule.

In mathematics, the Pocklington–Lehmer primality test is a primality test devised by Henry Cabourn Pocklington and Derrick Henry Lehmer. The test uses a partial factorization of to prove that an integer is prime.

References

  1. Joe Buhler, Algorithmic Number Theory: Third International Symposium, ANTS-III. New York: Springer (1998): 290
  2. 1 2 Norman Luhn & Dirk Augustin, Cunningham Chain records. Retrieved on 2025-01-29.
  3. Löh, Günter (October 1989). "Long chains of nearly doubled primes". Mathematics of Computation. 53 (188): 751–759. doi: 10.1090/S0025-5718-1989-0979939-8 .