  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\H{o}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.
