Prime clusters and Cunningham chains

DOI10.1090/S0025-5718-99-01117-5zbMath0927.11003MaRDI QIDQ4257703

Anthony D. Forbes

Publication date: 31 August 1999

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

zbMATH Keywords

Chinese remainder theoremCunningham chainsprime \(k\)-tuplets

Mathematics Subject Classification ID

Primes (11A41) Primality (11Y11)

Related Items (4)

A Frobenius problem suggested by prime \(k\)-tuplets ⋮ Some identities for enumerators of circulant graphs ⋮ Values of the Euler 𝜙-function not divisible by a given odd prime, and the distribution of Euler-Kronecker constants for cyclotomic fields ⋮ Two algorithms to find primes in patterns

Cites Work

• Unnamed Item
• Unnamed Item
• Long Chains of Nearly Doubled Primes
• New Primality Criteria and Factorizations of 2 m ± 1
• Primes in intervals
• Largest known twin primes
• Factorizations of 𝑏ⁿ±1, 𝑏=2, 3, 5, 6, 7, 10, 11, 12 Up to High Powers

This page was built for publication: Prime clusters and Cunningham chains