3 ms·
I had a kind of program which would find primes higher than the Sieve of Eratosthenes (typically this only goes up to 4 billion because of 1 bit per integer), c
by zandorg 17y ago
I had a kind of program which would find primes higher than the Sieve of Eratosthenes (typically this only goes up to 4 billion because of 1 bit per integer), called a 'Leapfrog' sieve, but someone said it wasn't very interesting, and I can't tell if it's been done before.
- pronoiac 17y agoPrime Links - http://primes.utm.edu/links/programs/ http://primes.utm.edu/links/programs/ - doesn't have anything about Leapfrog. On Ubuntu, if you install bsdgames, "primes" can generate a list of primes up to (checks) 2^32 (4.29 billion & change). djb's primegen - http://cr.yp.to/primegen.html http://cr.yp.to/primegen.html - goes up to 1000000000000000 (10^15).
- jacquesm 17y agoit's called a 'sliding window sieve'.