import math def sieve0fEratosthenes (N): This function returns a list of all the primes up to N. # Create a list of booleans indexed from 0 upto N. array = [True for i in range(N+1)] Prime the loop using the first prine, 2. p=2 Find the largest value we'll need to sieve with: limit = int (math, sqrt (N)) while p