Finding strong pseudoprimes to several bases. II
Finding strong pseudoprimes to several bases. II
Define $\psi _m$ to be the smallest strong pseudoprime to all the first $m$ prime bases. If we know the exact value of $\psi _m$, we will have, for integers $n<\psi _m$, a deterministic efficient primality testing algorithm which is easy to implement. Thanks to Pomerance et al. and Jaeschke, …