Beefy Boxes and Bandwidth Generously Provided by pair Networks
Perl: the Markov chain saw

Re^2: Prime Number Finder

by hv (Parson)
on Nov 11, 2005 at 14:59 UTC ( #507726=note: print w/ replies, xml ) Need Help??

in reply to Re: Prime Number Finder
in thread Prime Number Finder

Even if you had a quantum computer to run it on, I'm not convinced you'd have an O(1) algorithm unless you also have O(1) algorithms for computing sqrt($n) and 2..$n.

In any case however the algorithm will give the wrong answer for 2. You can fix that by replacing sqrt($n)+1 with sqrt($n+1).


Comment on Re^2: Prime Number Finder
Select or Download Code

Log In?

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

How do I use this? | Other CB clients
Other Users?
Others imbibing at the Monastery: (4)
As of 2015-11-29 19:05 GMT
Find Nodes?
    Voting Booth?

    What would be the most significant thing to happen if a rope (or wire) tied the Earth and the Moon together?

    Results (752 votes), past polls