A function which generates finds the primes up to a given n

erasto.py

 def erasto(n):
      primes = [True] * n
      sq = int(math.floor(math.sqrt(n)))
      for i in range(2,sq):
        j = i**2
        while j < n:
          primes[j] = False
          j += i
      return primes