Beefy Boxes and Bandwidth Generously Provided by pair Networks
No such thing as a small change
 
PerlMonks  

Extension To Very Large Numbers - Re: Prime Number Finder

by metadoktor (Hermit)
on Feb 07, 2002 at 10:34 UTC ( #143841=note: print w/replies, xml ) Need Help??


in reply to Prime Number Finder

While your code is very cool. A more powerful approach would probably be to extract the algorithms in Crandall's factor code which allows you to determine if any given number X is prime. You could call this algorithm in the loop for your specified range to solve the problem more quickly. :)

Of course, for very large X it will take much much longer to determine if X is prime.

metadoktor

"The doktor is in."

  • Comment on Extension To Very Large Numbers - Re: Prime Number Finder

Log In?
Username:
Password:

What's my password?
Create A New User
Node Status?
node history
Node Type: note [id://143841]
help
Chatterbox?
[stevieb]: yeah. This is my build/test software that manipulates perlbrew/ berrybrew, and runs all unit tests of a project against all installed versions, including testing a dist against all of it's current revdeps. A lot of tests it runs for itself:)
[stevieb]: testing the test build system, essentially

How do I use this? | Other CB clients
Other Users?
Others imbibing at the Monastery: (5)
As of 2017-03-26 22:10 GMT
Sections?
Information?
Find Nodes?
Leftovers?
    Voting Booth?
    Should Pluto Get Its Planethood Back?



    Results (315 votes). Check out past polls.