Finding 𝐶₃-strong pseudoprimes

DOI10.1090/S0025-5718-04-01693-XzbMath1069.11055MaRDI QIDQ4654036

Zhenxiang Zhang

Publication date: 1 March 2005

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

zbMATH Keywords

Carmichael numbersRabin-Miller teststrong pseudoprimes\(C_3\)-numbers

Mathematics Subject Classification ID

Factorization; primality (11A51) Power residues, reciprocity (11A15) Primality (11Y11)

Related Items (6)

Strong pseudoprimes to the first eight prime bases ⋮ An intelligent choice of witnesses in the Miller-Rabin primality test. Reinforcement learning approach ⋮ Notes on some new kinds of pseudoprimes ⋮ On the effectiveness of a generalization of Miller's primality theorem ⋮ Two kinds of strong pseudoprimes up to $10^{36}$ ⋮ SYLOW p-PSEUDOPRIMES TO SEVERAL BASES FOR SEVERAL PRIMES p

Cites Work

• Unnamed Item
• Probabilistic algorithm for testing primality
• Riemann's hypothesis and tests for primality
• There are infinitely many Carmichael numbers
• Constructing Carmichael numbers which are strong pseudoprimes to several bases
• Finding strong pseudoprimes to several bases
• Average Case Error Estimates for the Strong Probable Prime Test
• The Carmichael Numbers up to 10 15
• The Pseudoprimes to 25 ⋅10 9
• On Strong Pseudoprimes to Several Bases
• Finding strong pseudoprimes to several bases. II

This page was built for publication: Finding 𝐶₃-strong pseudoprimes