The Carmichael Numbers up to 10 15

DOI10.2307/2152963zbMath0780.11069arXivmath/0504119OpenAlexW4234026051WikidataQ116217666 ScholiaQ116217666MaRDI QIDQ3137477

Richard Pinch

Publication date: 23 January 1994

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

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

zbMATH Keywords

Carmichael numbers

Mathematics Subject Classification ID

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

Related Items (18)

Finding Carmichael numbers ⋮ Building pseudoprimes with a large number of prime factors ⋮ Notes on the equation \(d(n)=D(\varphi(n))\) and related inequalities ⋮ A new algorithm for constructing large Carmichael numbers ⋮ Carmichael numbers with \(p+1\mid n+1\) ⋮ Density of Carmichael numbers with three prime factors ⋮ Notes on some new kinds of pseudoprimes ⋮ Finding 𝐶₃-strong pseudoprimes ⋮ On primary Carmichael numbers ⋮ ON CARMICHAEL NUMBERS IN ARITHMETIC PROGRESSIONS ⋮ Two contradictory conjectures concerning Carmichael numbers ⋮ Finding strong pseudoprimes to several bases. II ⋮ Prime-number algorithm for public-key systems ⋮ Strengthening the Baillie-PSW primality test ⋮ Tabulating Carmichael numbers \(n=Pqr\) with small \(P\) ⋮ Higher-order Carmichael numbers ⋮ Constructing Carmichael numbers through improved subset-product algorithms ⋮ A one-parameter quadratic-base version of the Baillie-PSW probable prime test

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