Back to Search
Start Over
AVERAGE LIAR COUNT FOR DEGREE-2 FROBENIUS PSEUDOPRIMES.
- Source :
-
Mathematics of Computation . Jan2020, Vol. 89 Issue 321, p493-514. 22p. - Publication Year :
- 2020
-
Abstract
- In this paper we obtain lower and upper bounds on the average number of liars for the Quadratic Frobenius Pseudoprime Test of Grantham [Math. Comp. 70 (2001), pp. 873-891], generalizing arguments of ErdÅ‘s and Pomerance [Math. Comp. 46 (1986), pp. 259-279] and Monier [Theoret. Comput. Sci. 12 (1980), 97-108]. These bounds are provided for both Jacobi symbol ±1 cases, providing evidence for the existence of several challenge pseudoprimes. [ABSTRACT FROM AUTHOR]
- Subjects :
- *MATHEMATICS
*COUNTING
*ARGUMENT
*EVIDENCE
*SIGNS & symbols
Subjects
Details
- Language :
- English
- ISSN :
- 00255718
- Volume :
- 89
- Issue :
- 321
- Database :
- Academic Search Index
- Journal :
- Mathematics of Computation
- Publication Type :
- Academic Journal
- Accession number :
- 138971003
- Full Text :
- https://doi.org/10.1090/mcom/3452