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 ≤ ...

Infinite sets $P$ and $Q$ of primes are described, $P \subset Q$. For any natural number $n$ it can be decided if $n \in P$ in (deterministic) time $O((\log n)^9 ...

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, ...