Ovid said:
This is part of a larger set of code which is intended to be pure Perl, ...
Can you write a "half descent sieve" in Perl?
Also, how about if you want the 2e6 through 3e6 primes the first time you call and the 1e6 through 2e6 the second time?
In reply to Re^4: Math help: Finding Prime Numbers
by BrowserUk
in thread Math help: Finding Prime Numbers
by Ovid
| For: | Use: | ||
| & | & | ||
| < | < | ||
| > | > | ||
| [ | [ | ||
| ] | ] |