blob: f6559d51959b840232aac2527e7b0474738fdd94 (
plain)
1
2
3
4
5
6
7
8
9
10
11
12
13
14
|
def primes_python(nb_primes):
p = []
n = 2
while len(p) < nb_primes:
# Is n prime?
for i in p:
if n % i == 0:
break
# If no break occurred in the loop
else:
p.append(n)
n += 1
return p
|