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²⁰⁰, ...
The online computer game “Is this prime?” tests a player’s knowledge of prime numbers—and just surpassed 2,999,999 attempts. Give it a whirl. The Greek mathematician Euclid may very well have proved, ...
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 ≤ ...
The Clay Mathematics Institute (CMI) announces that its 2002 Annual Meeting will take place on Wednesday, October 30, 2002, from 2:30 to 5:30 PM, at the American Academy of Arts & Sciences in ...
Some results have been hidden because they may be inaccessible to you
Show inaccessible results
Feedback