Excellent. Based on your clarification, one can indeed use the divisibility check on previous computed primes to determine if current $number is prime.
You can learn non-Perl stuff on perlmonks too!! :-)
Thanks, Mahesh
In reply to Re^4: ulam's spiral too slow
by smahesh
in thread ulam's spiral too slow
by orange
| For: | Use: | ||
| & | & | ||
| < | < | ||
| > | > | ||
| [ | [ | ||
| ] | ] |