Prime clusters and Cunningham chains
The idea of prime pairs is extended to prime \(k\)-tuplets (e.g. \(p\), \(p+2\), \(p+6\) is a pattern for a 3-tuplet) and all possible patterns are obtained for \(k\leq 20\). It is not known if patterns exist for every \(k\). The largest known primes for each pattern are given for \(k\leq 16\) (and for one pattern, with \(k=17\), in an addendum). The method of search for \(k=16\) is described in detail. The method for finding prime 16-tuplets can be used for investigating Cunningham chains (sequences of primes such that \(p_{i+1}= 2p_i+1\) or \(p_{i+1}= 2p_i-1\)) and a number of results are reported.
- On admissible constellations of consecutive primes
- Some identities for enumerators of circulant graphs
- Long Chains of Nearly Doubled Primes
- Finding length-3 positive Cunningham chains and their cryptographic significance
- Two algorithms to find primes in patterns
- The largest known Cunningham chain of length 3 of the first kind
- scientific article; zbMATH DE number 7307802 (Why is no real title available?)
- Sieving for large twin primes and Cunningham chains of length 2 of the second kind
- Sieving for large Cunningham chains of length 3 of the first kind
- Values of the Euler -function not divisible by a given odd prime, and the distribution of Euler-Kronecker constants for cyclotomic fields
- A Frobenius problem suggested by prime \(k\)-tuplets
- Polynomial Cunningham chains
- A study of Cunningham bounds through rogue primes
- Partition-theoretic model of prime distribution
This page was built for publication: Prime clusters and Cunningham chains
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4257703)
