The Carmichael Numbers up to 10 15

DOI10.2307/2152963zbMATH Open0780.11069arXivmath/0504119OpenAlexW4234026051WikidataQ116217666 ScholiaQ116217666MaRDI QIDQ3137477FDOQ3137477

Authors: Richard Pinch 

Publication date: 23 January 1994

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

Abstract: We extend our previous computations to show that there are 585355 Carmichael numbers up to $10^{17}$. As before, the numbers were generated by a back-tracking search for possible prime factorisations together with a ``large prime variation. We present further statistics on the distribution of Carmichael numbers.

Full work available at URL: https://arxiv.org/abs/math/0504119

Recommendations

• The Carmichael Numbers to 10 12
• scientific article; zbMATH DE number 700553
• Counting Carmichael numbers with small seeds
• On the Number of Carmichael Numbers up to x
• A New Method for Producing Large Carmichael Numbers

zbMATH Keywords

Carmichael numbers

Mathematics Subject Classification ID

Computational number theory (11Y99) Factorization; primality (11A51) Primality (11Y11) Software, source code, etc. for problems pertaining to number theory (11-04)

Cited In (23)

• On primary Carmichael numbers
• A new algorithm for constructing large Carmichael numbers
• Constructing Carmichael numbers through improved subset-product algorithms
• Strengthening the Baillie-PSW primality test
• Title not available (Why is that?)
• The Carmichael Numbers to 10 12
• Notes on the equation \(d(n)=D(\varphi(n))\) and related inequalities
• On Carmichael numbers in arithmetic progressions
• Counting Carmichael numbers with small seeds
• Title not available (Why is that?)
• Building pseudoprimes with a large number of prime factors
• A one-parameter quadratic-base version of the Baillie-PSW probable prime test
• Carmichael numbers with \(p+1\mid n+1\)
• Density of Carmichael numbers with three prime factors
• Higher-order Carmichael numbers
• Two contradictory conjectures concerning Carmichael numbers
• Finding strong pseudoprimes to several bases. II
• Advances in tabulating Carmichael numbers
• Finding 𝐶₃-strong pseudoprimes
• Prime-number algorithm for public-key systems
• Finding Carmichael numbers
• Tabulating Carmichael numbers \(n=Pqr\) with small \(P\)
• Notes on some new kinds of pseudoprimes

This page was built for publication: The Carmichael Numbers up to 10 15

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