-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathproblem00007.py
More file actions
40 lines (30 loc) · 800 Bytes
/
problem00007.py
File metadata and controls
40 lines (30 loc) · 800 Bytes
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
#!/usr/bin/env
# 10001st prime
# Problem 7
# By listing the first six prime numbers: 2, 3, 5, 7, 11, and 13, we can see that the 6th prime is 13.
# What is the 10 001st prime number?
import math
from itertools import islice
def isprime(n):
if n == 1:
return False
for i in xrange(2, int(math.sqrt(n)) + 1):
if n % i == 0:
return False
return True
def naturalnumbers():
x = 0
while True:
x += 1
yield x
def primenumbers():
for x in naturalnumbers():
if isprime(x):
yield x
# from itertools recipes
def nth(iterable, n, default=None):
"Returns the nth item or a default value"
return next(islice(iterable, n, None), default)
nth_prime=lambda n: nth(primenumbers(), n)
n=10001
print(nth_prime(n))