http://burntjet.co.uk/maths/primes/sieves.php#eq_sieve_div
I have read that Sieve of Eratosthenes algorithm can be speeded up with wheel factorization. Can similar be done with Euler's sieve (while in between taking out composite numbers from the list of N numbers)?
Because for number 2 every second number is removed (list reduced). Then after that; for multiplications of 3, it is every third number removed starting from number 3. For number 5 we have composite numbers of 5 in a sequence +7th,+3th number... removed starting from number 5. For number 7 it is a +12th,+7th,+4th,+7th,+4th,+7th,+12th,+3th...and again... starting from number 7 in the list...
And so on....? Was this implemented before?
Maybe next paper (Fabio’s sieve ) can be of help? http://arxiv.org/find/all/1/all:+AND+fabio+sieve/0/1/0/all/0/1