Improved error bounds for the Fermat primality test on random inputs
classification
🧮 math.NT
keywords
randomestimatesfermatprimalitytestboundsclosecomposite
read the original 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 $2^{200}$, our results improve on prior estimates by close to 3 orders of magnitude.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.