Finding 𝐶₃-strong pseudoprimes
From MaRDI portal
Publication:4654036
Recommendations
- Two kinds of strong pseudoprimes up to $10^{36}$
- Strong pseudoprimes to twelve prime bases
- Finding strong pseudoprimes to several bases. II
- scientific article; zbMATH DE number 1094206
- Finding strong pseudoprimes to several bases
- On Strong Pseudoprimes to Several Bases
- Constructing Carmichael numbers which are strong pseudoprimes to several bases
- The Pseudoprimes to 25 ⋅10 9
- Strong pseudoprimes to the first eight prime bases
- scientific article; zbMATH DE number 2098064
Cites work
- scientific article; zbMATH DE number 2206373 (Why is no real title available?)
- Average Case Error Estimates for the Strong Probable Prime Test
- Constructing Carmichael numbers which are strong pseudoprimes to several bases
- Finding strong pseudoprimes to several bases
- Finding strong pseudoprimes to several bases. II
- On Strong Pseudoprimes to Several Bases
- Probabilistic algorithm for testing primality
- Riemann's hypothesis and tests for primality
- The Carmichael Numbers up to 10 15
- The Pseudoprimes to 25 ⋅10 9
- There are infinitely many Carmichael numbers
Cited in
(10)- Notes on some new kinds of pseudoprimes
- On the effectiveness of a generalization of Miller's primality theorem
- Sylow \(p\)-pseudoprimes to several bases for several primes \(p\)
- GCD calculation in the search task of pseudoprime and strong pseudoprime numbers
- Strong pseudoprimes to twelve prime bases
- Strong pseudoprimes to the first eight prime bases
- Finding strong pseudoprimes to several bases
- Two kinds of strong pseudoprimes up to $10^{36}$
- On the continued fraction with rational partial quotients
- An intelligent choice of witnesses in the Miller-Rabin primality test. Reinforcement learning approach
This page was built for publication: Finding 𝐶₃-strong pseudoprimes
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4654036)
