Strong pseudoprimes to twelve prime bases
Jonathan Sorenson, Jonathan Webster · Mathematics of Computation · 2016
Let ψ m \psi _m be the smallest strong pseudoprime to the first m m prime bases. This value is known for 1 ≤ m ≤ 11 1 \leq m \leq 11 . We extend this by finding ψ 12 \psi _{12} and ψ 13 \psi _{13} . We also present an algorithm to find all integers n ≤ B n\le B that are strong pseudoprimes to the first m m prime bases; with reasonable heuristic assumptions we can show that it takes at most B 2 / 3 + o ( 1 ) B^{2/3+o(1)} time.