An initial Python implementation for the Sieve of Atkin.
The Sieve of Atkin is a modern algorithm to find all the primes up to a specfic integer.
For some details on the algorithm check the Wikipedia page: http://en.wikipedia.org/wiki/Sieve_of_Atkin.
For more profund details check A.O.L. Atkin, D.J. Bernstein, Prime sieves using binary quadratic forms, Math. Comp. 73 (2004), 1023-1030: http://www.ams.org/mcom/2004-73-246/S0025-5718-03-01501-1/S0025-5718-03-01501-1.pdf
This work is licensed under a Creative Commons Attribution-NonCommercial-ShareAlike 3.0 Unported License.
