Beefy Boxes and Bandwidth Generously Provided by pair Networks
Perl Monk, Perl Meditation
 
PerlMonks  

(ichimunki) Re: Prime Number Finder

by ichimunki (Priest)
on Feb 07, 2002 at 19:59 UTC ( #143959=note: print w/ replies, xml ) Need Help??


in reply to Prime Number Finder

You may as well write

for($i=$o; $i<=$e; $i++){
as
print "2 is prime\n" if $o == 2; $o++ if $o % 2; for my $i ( $i=$o; $i<=$e; $i+=2 ){
That way you start on an odd number and account for the only even number which is prime. There is no need to check even numbers after 2.


Comment on (ichimunki) Re: Prime Number Finder
Select or Download Code
Re^2: Prime Number Finder
by dragonchild (Archbishop) on Nov 11, 2005 at 23:07 UTC
    $o++ if $o % 2 == 0;

    My criteria for good software:
    1. Does it work?
    2. Can someone else come in, make a change, and be reasonably certain no bugs were introduced?

Log In?
Username:
Password:

What's my password?
Create A New User
Node Status?
node history
Node Type: note [id://143959]
help
Chatterbox?
and the web crawler heard nothing...

How do I use this? | Other CB clients
Other Users?
Others exploiting the Monastery: (11)
As of 2014-08-28 07:39 GMT
Sections?
Information?
Find Nodes?
Leftovers?
    Voting Booth?

    The best computer themed movie is:











    Results (257 votes), past polls