cython

1
def primes(nb_primes):
2
    p = []
3
    n = 2
4
    while len(p) < nb_primes:
5
        # Is n prime?
6
        for i in p:
7
            if n % i == 0:
8
                break
9

10
        # If no break occurred in the loop
11
        else:
12
            p.append(n)
13
        n += 1
14
    return p
15