Prime Function

def get_primes(n):
primes = []
candidate = 2
while len(primes) < n:
for p in primes:
if candidate % p == 0:
break
else:
primes.append(candidate)
candidate += 1
return primes

原文链接：Prime Function