Answer by SilentDirge for Sieve of Eratosthenes - Finding Primes Python

My implementation:

import mathn = 100marked = {}for i in range(2, int(math.sqrt(n))):    if not marked.get(i):        for x in range(i * i, n, i):            marked[x] = Truefor i in range(2, n):    if not marked.get(i):        print i