I'm trying to write a generator function for printing prime numbers as follows

 def getPrimes(n):prime=Truei=2while(i<n):for a in range(2,i):if(i%a==0):prime=Falsebreakif(prime):    yield i

However I'm not getting the desired results p=getPrimes(100) should give me a generator function that will iterate primes from 2 through 100 but the result I'm getting is [2,3]. What am I doing wrong?

Sieve of Eratosthenes: Most efficient prime generator algorithm

Taken from here:

It marks off all the multiples of 2, 3, 5, 7 and 11. The rest are all prime numbers.

def genprimes(limit): # derived from # Code by David Eppstein, UC Irvine, 28 Feb 2002D = {}            # http://code.activestate.com/recipes/117119/q = 2while q <= limit:if q not in D:yield qD[q * q] = [q]else:for p in D[q]:D.setdefault(p + q, []).append(p)del D[q]q += 1p = genprimes(100)
prms = [i for i in p]print prms

Output:

[2, 3, 5, 7, 11, 13, 17, 19, 23, 29, 31, 37, 41, 43, 47, 53, 59, 61, 67, 71, 73, 79, 83, 89, 97]