def dmercer(number, start=2):
 sieve = []
 for n in xrange(start, (number + 1)):
  is_prime = True
  for p in sieve:
   if ((n % p) == 0):
    is_prime = False
    break
   if ((p * p) > n):
    break
  if is_prime:
   sieve.append(n)
 return sieve

def dmercer ( number , start = 2 ) : sieve = [ ] for n in xrange ( start , ( number + 1 ) ) : is_prime = True for p in sieve : if ( ( n % p ) == 0 ) : is_prime = False break if ( ( p * p ) > n ) : break if is_prime : sieve . append ( n ) return sieve
sift the twos and sift the threes .