Two kinds of strong pseudoprimes up to $10^{36}$
From MaRDI portal
Publication:3592695
DOI10.1090/S0025-5718-07-01977-1zbMath1131.11082MaRDI QIDQ3592695
Publication date: 13 September 2007
Published in: Mathematics of Computation (Search for Journal in Brave)
probabilistic primality testsRabin-Miller test\(C_3\)-strong pseudoprimes\(K2\)-strong pseudoprimesthe least strong pseudoprime to the first \(t\) bases
Number-theoretic algorithms; complexity (11Y16) Factorization; primality (11A51) Power residues, reciprocity (11A15) Primality (11Y11)
Related Items (6)
Strong pseudoprimes to the first eight prime bases ⋮ Strong pseudoprimes to twelve prime bases ⋮ An intelligent choice of witnesses in the Miller-Rabin primality test. Reinforcement learning approach ⋮ The error probability of the Miller-Rabin primality test ⋮ On the effectiveness of a generalization of Miller's primality theorem ⋮ SYLOW p-PSEUDOPRIMES TO SEVERAL BASES FOR SEVERAL PRIMES p
Cites Work
- Unnamed Item
- Probabilistic algorithm for testing primality
- Evaluation and comparison of two efficient probabilistic primality testing algorithms
- Riemann's hypothesis and tests for primality
- Finding strong pseudoprimes to several bases
- Average Case Error Estimates for the Strong Probable Prime Test
- The Pseudoprimes to 25 ⋅10 9
- On Strong Pseudoprimes to Several Bases
- Finding strong pseudoprimes to several bases. II
- Finding 𝐶₃-strong pseudoprimes
- Unsolved problems in number theory
This page was built for publication: Two kinds of strong pseudoprimes up to $10^{36}$
