http://code.activestate.com/recipes/tags/primality_testing-primes/2011-01-17T18:42:06-08:00ActiveState Code Recipes2011-01-17T18:42:06-08:00Mukesh Tiwarihttp://code.activestate.com/recipes/users/4172899/http://code.activestate.com/recipes/577544-elliptic-curve-prime-factorisation/

<p style="color: grey"> Python recipe 577544 by <a href="/recipes/users/4172899/">Mukesh Tiwari</a> (<a href="/recipes/tags/primality_testing/">primality_testing</a>). Revision 3. </p> <p>Hello all, I implemented this using Wikipedia [http://en.wikipedia.org/wiki/Lenstra_elliptic_curve_factorization] and some codes from google code search[extended_gcd and gcd].In my opinion, this code is not optimized and can be further improved. Feel free to post your comment. Thank You</p>

2008-10-28T12:14:03-07:00TheMachineCharmerhttp://code.activestate.com/recipes/users/4167676/http://code.activestate.com/recipes/576543-prime-number-generator-checker/

<p style="color: grey"> Python recipe 576543 by <a href="/recipes/users/4167676/">TheMachineCharmer</a> (<a href="/recipes/tags/number_theory/">number_theory</a>, <a href="/recipes/tags/primality_testing/">primality_testing</a>, <a href="/recipes/tags/prime_number/">prime_number</a>). Revision 2. </p> <p>This program implements primality testing function. The function is then used to generate prime numbers in the given range.</p>