Beefy Boxes and Bandwidth Generously Provided by pair Networks
go ahead... be a heretic

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.


"The doktor is in."

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

Log In?

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

How do I use this? | Other CB clients
Other Users?
Others making s'mores by the fire in the courtyard of the Monastery: (7)
As of 2015-11-28 00:12 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 (735 votes), past polls