go ahead... be a heretic | |
PerlMonks |
comment on |
( [id://3333]=superdoc: print w/replies, xml ) | Need Help?? |
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." In reply to Extension To Very Large Numbers - Re: Prime Number Finder
by metadoktor
|
|