Average liar count for degree-2 Frobenius pseudoprimes
Abstract
In this paper we obtain lower and upper bounds on the average number of liars for the Quadratic Frobenius Pseudoprime Test of Grantham, generalizing arguments of Erdos and Pomerance, and Monier. These bounds are provided for both Jacobi symbol plus and minus cases, providing evidence for the existence of several challenge pseudoprimes.
0
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.