Average liar count for degree-$2$ Frobenius pseudoprimes

DOI10.1090/mcom/3452zbMath1450.11123arXiv1707.05002OpenAlexW2736594816MaRDI QIDQ5235112

Andrew Shallue, Andrew Fiori

Publication date: 7 October 2019

Published in: Mathematics of Computation (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1707.05002

zbMATH Keywords

Lucas pseudoprimeprimality testingpseudoprimeFrobenius pseudoprimeFermat pseudoprime

Mathematics Subject Classification ID

Primes (11A41) Primality (11Y11)

Related Items (1)

Strengthening the Baillie-PSW primality test

Cites Work

• Unnamed Item
• Unnamed Item
• There are infinitely many Perrin pseudoprimes
• Evaluation and comparison of two efficient probabilistic primality testing algorithms
• Frobenius pseudoprimes
• Binomial Coefficients and the Distribution of the Primes
• On the Number of False Witnesses for a Composite Number
• The Pseudoprimes to 25 ⋅10 9
• Lucas Pseudoprimes
• Shifted primes without large prime factors
• Higher-order Carmichael numbers
• On the Distribution of Pseudoprimes
• Unsolved problems in number theory
• Polynomial values free of large prime factors

This page was built for publication: Average liar count for degree-$2$ Frobenius pseudoprimes