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²⁰⁰, ...
Mathematics of Computation, Vol. 61, No. 203, Special Issue Dedicated to Derrick Henry Lehmer (Jul., 1993), pp. 69-82 (14 pages) For an integer n, let G(n) denote the smallest x such that the primes ≤ ...
Results that may be inaccessible to you are currently showing.
Hide inaccessible results
Feedback