A new algorithm for constructing large Carmichael numbers
From MaRDI portal
Publication:4878584
DOI10.1090/S0025-5718-96-00692-8zbMath0855.11066WikidataQ56041262 ScholiaQ56041262MaRDI QIDQ4878584
Publication date: 14 May 1996
Published in: Mathematics of Computation (Search for Journal in Brave)
Carmichael function; absolute pseudoprime; probabilistic algorithm for constructing large Carmichael numbers
11Y16: Number-theoretic algorithms; complexity
11-04: Software, source code, etc. for problems pertaining to number theory
11A51: Factorization; primality
11Y11: Primality
Related Items
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