Beefy Boxes and Bandwidth Generously Provided by pair Networks
Just another Perl shrine
 
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.

Replies are listed 'Best First'.
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 all is quiet...

How do I use this? | Other CB clients
Other Users?
Others making s'mores by the fire in the courtyard of the Monastery: (2)
As of 2016-12-10 11:09 GMT
Sections?
Information?
Find Nodes?
Leftovers?
    Voting Booth?
    On a regular basis, I'm most likely to spy upon:













    Results (162 votes). Check out past polls.