Long Chains of Nearly Doubled Primes

DOI10.2307/2008735zbMath0674.10006OpenAlexW4254378619MaRDI QIDQ3828066

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 chainsprime chainsnearly doubled primesprime k-tuples conjecture

Mathematics Subject Classification ID

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

Related Items (5)

Prime clusters and Cunningham chains ⋮ A new algorithm for constructing large Carmichael numbers ⋮ Some identities for enumerators of circulant graphs ⋮ An integer optimization problem with mixed algebraic and number-theoretic constraints ⋮ Two algorithms to find primes in patterns

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