Two kinds of strong pseudoprimes up to 10³⁶
From MaRDI portal
Publication:3592695
Recommendations
Cites work
- Average Case Error Estimates for the Strong Probable Prime Test
- Evaluation and comparison of two efficient probabilistic primality testing algorithms
- Finding strong pseudoprimes to several bases
- Finding strong pseudoprimes to several bases. II
- Finding 𝐶₃-strong pseudoprimes
- scientific article; zbMATH DE number 2206373 (Why is no real title available?)
- On Strong Pseudoprimes to Several Bases
- Probabilistic algorithm for testing primality
- Riemann's hypothesis and tests for primality
- The Pseudoprimes to 25 ⋅10 9
- Unsolved problems in number theory
Cited in
(13)- Constructing Carmichael numbers which are strong pseudoprimes to several bases
- The error probability of the Miller-Rabin primality test
- An intelligent choice of witnesses in the Miller-Rabin primality test. Reinforcement learning approach
- Finding strong pseudoprimes to several bases
- scientific article; zbMATH DE number 1643946 (Why is no real title available?)
- Strong pseudoprimes to twelve prime bases
- Strong pseudoprimes to the first eight prime bases
- Pseudoprime Statistics to 1019
- Some new kinds of pseudoprimes
- Finding 𝐶₃-strong pseudoprimes
- Strong pseudoprimes, covering systems of congruences and generalized bent functions
- Sylow p-pseudoprimes to several bases for several primes p
- On the effectiveness of a generalization of Miller's primality theorem
This page was built for publication: Two kinds of strong pseudoprimes up to $10^{36}$
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3592695)