mirror of
https://github.com/correl/euler.git
synced 2024-11-24 03:00:08 +00:00
17 lines
368 B
Python
17 lines
368 B
Python
|
def primes(limit):
|
||
|
|
primes = []
|
||
|
|
i = 2
|
||
|
|
while len(primes) < limit:
|
||
|
|
is_prime = True
|
||
|
|
for p in primes:
|
||
|
|
if i % p == 0:
|
||
|
|
is_prime = False
|
||
|
|
break
|
||
|
|
if is_prime:
|
||
|
|
primes.append(i)
|
||
|
|
i = i + 1
|
||
|
|
return primes
|
||
|
|
|
||
|
|
print '6th Prime', primes(6)[-1]
|
||
|
|
print '10001st Prime', primes(10001)[-1]
|