-
Morten Welinder authored
Use a chunked sieve so we don't have to compute that many primes until and unless someone needs them. Calculating all 10^8 primes takes about 10s on my poor laptop. For reference, the 100,000,000th prime is 2,038,074,743. Still below the limit of a signed int. (We actually use unsigned, so lots of room.)
2cbc1f77
To find the state of this project's repository at the time of any of these versions, check out the tags.