def genPrimes(n):
    primes = [2]   # primes generated so far
    last = 3      # last number tried
    while last <= n:        
        for p in primes:
            if last % p == 0 and math.sqrt(p) <= last:
                break
        else:
            primes.append(last)
        last += 2
    return primes