http://www.perlmonks.org?node_id=610443


in reply to Re^3: ulam's spiral too slow
in thread ulam's spiral too slow

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