code: def eratosthene(n):
      
      P = [True] * n
      answ = [2]
      for i in range(3, n, 2):
          if P[i]:
              answ.append(i)
              for j in range(2 * i, n, i):
                  P[j] = False
      return answ
docs: Prime numbers by sieve of Eratosthene
  
      :param n: positive integer
      :assumes: n > 2
      :returns: list of prime numbers <n
      :complexity: O(n loglog n)