Long Chains of Nearly Doubled Primes

DOI10.2307/2008735MaRDI QIDQ3828066zbMATH OpenOpenAlexFDO

Authors Günter Löh

Publication date 1989

Published in Mathematics of Computation (Search for Journal in Brave)

Full work available at URL https://doi.org/10.2307/2008735

zbMATH Keywords

computational number theoryCunningham chainsnearly doubled primesprime chainsprime k-tuples conjecture

Mathematics Subject Classification ID

Software, source code, etc. for problems pertaining to number theory (11-04) Primes (11A41) Recurrences (11B37)

Recommendations

• Prime clusters and Cunningham chains
• Prime Desert n-Tuplets
• Prime chains and Pratt trees
• scientific article; zbMATH DE number 1186949
• Sieving for large twin primes and Cunningham chains of length 2 of the second kind

Cited in

(15)

• Some identities for enumerators of circulant graphs
• An integer optimization problem with mixed algebraic and number-theoretic constraints
• scientific article; zbMATH DE number 1643954 (Why is no real title available?)
• Prime clusters and Cunningham chains
• A Graph of Primes
• scientific article; zbMATH DE number 1788104 (Why is no real title available?)
• A new algorithm for constructing large Carmichael numbers
• 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 Cunningham chains of length 3 of the first kind
• Prime chains and Pratt trees
• A study of Cunningham bounds through rogue primes
• A note on Sophie Germain primes
• A note on Fermat's congruence

This page was built for publication: Long Chains of Nearly Doubled Primes

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3828066)