go ahead... be a heretic | |
PerlMonks |
Re^4: ulam's spiral too slowby smahesh (Pilgrim) |
on Apr 17, 2007 at 03:30 UTC ( [id://610443]=note: print w/replies, xml ) | Need Help?? |
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 Section
Seekers of Perl Wisdom
|
|