RE: [PrimeNumbers] anything unique about this?
- On 26 March 2007 07:50 AM, Wes wrote in primenumbers:
W>> Are methods to do this well-known in number theory ... <<W
Yes, of course. There are a number of ways - generally, based on
Eratosthenes sieve - of identifying / generating the primes along the lines
See, for instance: "Three Theorems on modular sieves that suggest the Prime
Difference is O(Number of primes < (p(n)^1/2))"