Notes on some new kinds of pseudoprimes
From MaRDI portal
Publication:5713239
DOI10.1090/S0025-5718-05-01775-8zbMath1092.11001MaRDI QIDQ5713239
Publication date: 12 December 2005
Published in: Mathematics of Computation (Search for Journal in Brave)
Miller tests\(k\)-fold Carmichael Sylow pseudoprimeselementary Abelian \(p\)-pseudoprimesStrong pseudoprimesSylow \(p\)-pseudoprimesSylow uniform pseudoprimes
Related Items (3)
An intelligent choice of witnesses in the Miller-Rabin primality test. Reinforcement learning approach ⋮ On the effectiveness of a generalization of Miller's primality theorem ⋮ SYLOW p-PSEUDOPRIMES TO SEVERAL BASES FOR SEVERAL PRIMES p
Cites Work
- Probabilistic algorithm for testing primality
- Riemann's hypothesis and tests for primality
- There are infinitely many Carmichael numbers
- PRIMES is in P
- Finding strong pseudoprimes to several bases
- The Carmichael Numbers up to 10 15
- A one-parameter quadratic-base version of the Baillie-PSW probable prime test
- The Pseudoprimes to 25 ⋅10 9
- On Strong Pseudoprimes to Several Bases
- Finding strong pseudoprimes to several bases. II
- Some new kinds of pseudoprimes
- Finding 𝐶₃-strong pseudoprimes
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: Notes on some new kinds of pseudoprimes