Improved error bounds for the Fermat primality test on random inputs
Number Theory
2019-01-08 v2
Abstract
We investigate the probability that a random odd composite number passes a random Fermat primality test, improving on earlier estimates in moderate ranges. For example, with random numbers to , our results improve on prior estimates by close to 3 orders of magnitude.
Cite
@article{arxiv.1609.05569,
title = {Improved error bounds for the Fermat primality test on random inputs},
author = {Jared D. Lichtman and Carl Pomerance},
journal= {arXiv preprint arXiv:1609.05569},
year = {2019}
}
Comments
20 pages; minor edits to improve the results slightly and to elaborate the argument