Average liar count for degree-2 Frobenius pseudoprimes
arXiv:1707.05002 · doi:10.1090/mcom/3452
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 Erdős 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.
19 pages, published in Mathematics of Computation, revised version fixes typos and made a minor correction to the proof of Lemma 18 (result remains unchanged)