Estimating the counts of Carmichael and Williams numbers with small multiple seeds
From MaRDI portal
Publication:5497025
DOI10.1090/S0025-5718-2014-02837-8zbMath1315.11101MaRDI QIDQ5497025
Publication date: 30 January 2015
Published in: Mathematics of Computation (Search for Journal in Brave)
algorithmsKorselt's criterionWilliams numbersCarmichael numbers (with small multiple seeds)Erdős's construction of Carmichael numberseven-divisors-optimal numbers (EDONs)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- There are infinitely many Carmichael numbers
- Counting Carmichael numbers with small seeds
- A one-parameter quadratic-base version of the Baillie-PSW probable prime test
- KORSELT NUMBERS AND SETS
- New Primality Criteria and Factorizations of 2 m ± 1
- On Numbers Analogous to the Carmichael Numbers
- The 𝑘^{𝑡ℎ} prime is greater than 𝑘(ln𝑘+lnln𝑘-1) for 𝑘≥2
- Répartition Des Nombres Hautement Composés de Ramanujan
- On Highly Composite and Similar Numbers
- On Highly Composite Numbers