The problem with the algorithms described in the previous post lies on the very large amount of redundant testing that goes on. Because once we have checked the primality of a certain number p, we know that 2p, 3p, 4p, …, np are composites. So what is the point of checking those numbers at all? When you follow this line of thinking to the very end, it turns out you don’t have to do any trial division at all! The resulting algorithm is attributed to Erathostenes, and it employs a technique, known as sieving, which may come in handy in many other problems. But enough for a presentation, lets get going with the Sieve of Erathostenes.

All the information we need to begin with, is that 2 is the first prime. This means, following the previous approach, that no other even number can be prime. To keep track of this information, we begin by writing a list of all the numbers between 2 and the desired limit, say N:

We now draw a circle around 2, because it is prime, and then strike out all even numbers, i.e. all multiples of 2:

Now, there is a good and a bad way to strike out all multiples of a number from a list. The wrong way is to do trial division to find out if it is a multiple. The right way is to use the fact that two consecutive multiples of a number differ by that exact number. Writing it out in python, you can check the tremendous gain for yourself:

from time import time def strikeOut(mul, n) : # note that list index i corresponds to number i+2 sieve = [True for j in xrange(2,n+1)] # The bad way to sieve t = time() for j in xrange(2,n+1) : if j % mul == 0 : sieve[j-2] = False t = time() - t print "Sieved (bad!!!) all multiples of",mul,"below",n,"in",t,"sec." sieve = [True for j in xrange(2,n+1)] # The good way to sieve t = time() for j in xrange(mul,n+1,mul) : sieve[j-2] = False t = time() - t print "Sieved (good!!!) all multiples of",mul,"below",n,"in",t,"sec."

No, I’m not taking you, dear reader, for an idiot: you can find sieving algorithms on fist pages of google searches that do sieving this very wrong way…

But lets get back to primes. We had our list, with 2 circled and all its multiples crossed out. The first unmarked number we come across is 3. Just a coincidence that 3 is a prime number? Not really: it is unmarked because it is not a multiple of any smaller number. Or to put it another way: it is only divisible by 1 and itself, which is the very definition of prime… So we circle 3 and cross out all its multiples:

I’ve underlined the multiples of three that where already crossed out. The first number which gets crossed out for the first time is 9. Will it be just a coincidence that 9 = 3^{2}? Of course not! We have already crossed out all multiples of numbers smaller than 3, and 3^{2} is the first multiple of 3 which is not a multiple of any smaller number.

So we keep going down our list, and find 5 to be the next unmarked number in the list, which of course is prime, so we circle it, and then cross out all of its multiples. But as we saw before, rather than starting at 10, and crossing out the already crossed out 10, 15 and 20, we proceed directly to 5^{2}, that is 25.

This goes on until we’ve searched the whole list, circling numbers and crossing out its multiples. But since we start crossing out at the square of the new found prime, we only need to do the crossing out for primes smaller than the square root of N: once we get there, any uncrossed number up to N will be prime. This is what the beginning of our list will look like once we are through:

So lets try and write our very own sieve of Erathostenes in python, with all this square and square root tricks pointed out above…

from time import time from math import sqrt def primeListSofE(n, verbose = True) : t = time() sieve = [True for j in xrange(2,n+1)] for j in xrange(2,int(sqrt(n))+1) : i = j-2 if sieve[i]: for k in range(j*j,n+1,j) : sieve[k-2] = False ret = [j for j in xrange(2,n+1) if sieve[j-2]] if verbose : print "Calculated primes to",n,"in",time()-t,"sec." return ret

Play around with it and once more feel the thrill of speed. On my computer it does all primes below 1,000,000 almost 5 times faster than the best trial division approach from the previous post. But the real beauty is in how the time now scales with n, because you can no longer find a suitable fit of the form n^{q}. We haven’t simply reduced the size of the exponent, but are treading uncharted territory, as it turns out that the time required to calculate all primes below using this sieve requires (n.log(n))(log(log(n))) time. Actually, for the first 10^{10} numbers, this is basically indistinguishable from linear time, i.e proportional to n.

This speed does come at a memory cost, though: you need to store an array of size n. And while the algorithm could produce all primes below 10^{10} in just a few minutes, the program will very likely crash giving an out of memory error. Some memory saving can be done by not storing even numbers at all. Without boring you with the details, below is the python function I use to compute primes at work, which does 10^{7} almost three times faster than the previous one, and uses half the memory, but still crashes when asked for all primes below 10^{9}…

from time import time from math import sqrt def primeListSofE(n, verbose = False) : """ Returns a list of prime numbers smaller than or equal to n, using an optimized sieve of Erathostenes algorithm. """ t = time() maxI = (n-3) // 2 maxP = int(sqrt(n)) sieve = [True for j in xrange(maxI+1)] for p in xrange(3,maxP+1,2) : i = (p-3) // 2 if sieve[i] : i2 = (p*p-3) // 2 for k in xrange(i2,maxI+1,p) : sieve[k] = False ret = [2]+[2*j+3 for j in xrange(len(sieve)) if sieve[j]] if verbose : print "Calculated primes to",n,"in",time()-t,"sec." return ret

There are slightly faster ways of sieving, and we could memoize precalculated primes, to speed up repeated calls to the function. But this is probably enough for today’s post…