A New Method for Producing Large Carmichael Numbers

DOI10.2307/2008373MaRDI QIDQ3832635zbMATH OpenOpenAlexFDO

Authors Harvey Dubner

Publication date 1989

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

zbMATH Keywords

computational number theorylarge three-component Carmichael numbers

Mathematics Subject Classification ID

Software, source code, etc. for problems pertaining to number theory (11-04) Fibonacci and Lucas numbers and polynomials and generalizations (11B39)

Recommendations

• scientific article; zbMATH DE number 700553
• scientific article; zbMATH DE number 880168
• A new algorithm for constructing large Carmichael numbers
• The Carmichael Numbers to 10 12
• Constructing Carmichael numbers through improved subset-product algorithms

Cites work

• scientific article; zbMATH DE number 3970821 (Why is no real title available?)
• scientific article; zbMATH DE number 3665033 (Why is no real title available?)
• scientific article; zbMATH DE number 3750146 (Why is no real title available?)
• Larger Carmichael numbers
• New Primality Criteria and Factorizations of 2 m ± 1
• On Fermat’s simple theorem

Cited in

(9)

• Building pseudoprimes with a large number of prime factors
• Tabulating Carmichael numbers \(n=Pqr\) with small \(P\)
• Constructing Carmichael numbers through improved subset-product algorithms
• The Carmichael Numbers up to 10 15
• scientific article; zbMATH DE number 5290084 (Why is no real title available?)
• scientific article; zbMATH DE number 700553 (Why is no real title available?)
• Density of Carmichael numbers with three prime factors
• scientific article; zbMATH DE number 880168 (Why is no real title available?)
• A new algorithm for constructing large Carmichael numbers

This page was built for publication: A New Method for Producing Large Carmichael Numbers

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