A different take on finding primes

Vincent Davis vincent at vincentdavis.net
Sun Nov 15 02:01:48 CET 2009


Out of pure curiosity I would like to compare the efficiency of different
methods of finding primes (need not be consecutive). Let me be clear, given
2min, how many primes can you find, they need not be in order or
consecutive. I have not seen any examples of this. I am assume the solution
is different depending on the time give,  2min or 2 hours. I assume a sieve
solution would be best for larger times. When the numbers get really large
checking to see if they are a prime gets costly.
So what do you think?

  *Vincent Davis
720-301-3003 *
vincent at vincentdavis.net
 my blog <http://vincentdavis.net> |
LinkedIn<http://www.linkedin.com/in/vincentdavis>
-------------- next part --------------
An HTML attachment was scrubbed...
URL: <http://mail.python.org/pipermail/python-list/attachments/20091114/0f6a6590/attachment.html>


More information about the Python-list mailing list