Frobenius pseudoprimes with respect to polynomial form a sequence:
Although a single round of Frobenius is slower than a single round of most standard tests, it has the advantage of a much smaller worst-case per-round error bound of , which would require 7 rounds to achieve with the Miller–Rabin primality test according to best known bounds.
Strong Frobenius pseudoprimes
- R. Crandall, C. B. Pomerance (2005). Prime Numbers: A Computational Perspective (2nd ed. ed.). Springer. p. 613. ISBN 9780387252827.
- Symmetric Pseudoprimes, MathPages.
|This number theory-related article is a stub. You can help Wikipedia by expanding it.|