A new algorithm for constructing large Carmichael numbers

DOI10.1090/S0025-5718-96-00692-8zbMath0855.11066DBLPjournals/moc/LohN96OpenAlexW2009029861WikidataQ56041262 ScholiaQ56041262MaRDI QIDQ4878584

Wolfgang Niebuhr, Günter Löh

Publication date: 14 May 1996

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

Full work available at URL: https://doi.org/10.1090/s0025-5718-96-00692-8

zbMATH Keywords

Carmichael functionabsolute pseudoprimeprobabilistic algorithm for constructing large Carmichael numbers

Mathematics Subject Classification ID

Number-theoretic algorithms; complexity (11Y16) Software, source code, etc. for problems pertaining to number theory (11-04) Factorization; primality (11A51) Primality (11Y11)

Related Items (2)

Carmichael numbers and the sieve ⋮ Constructing Carmichael numbers through improved subset-product algorithms

Cites Work

• Larger Carmichael numbers
• There are infinitely many Carmichael numbers
• The Carmichael Numbers up to 10 15
• Long Chains of Nearly Doubled Primes
• A New Method for Producing Large Carmichael Numbers
• Twenty-Two Primes in Arithmetic Progression
• On Fermat’s simple theorem
• Prime numbers and computer methods for factorization
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: A new algorithm for constructing large Carmichael numbers