Beefy Boxes and Bandwidth Generously Provided by pair Networks
There's more than one way to do things
 
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?
and the web crawler heard nothing...

How do I use this? | Other CB clients
Other Users?
Others studying the Monastery: (6)
As of 2014-09-23 00:01 GMT
Sections?
Information?
Find Nodes?
Leftovers?
    Voting Booth?

    How do you remember the number of days in each month?











    Results (208 votes), past polls