Advertisement
Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- import math
- def is_prime(i):
- sq=int(math.sqrt(i)+1)
- for p in range(3,sq,2):
- if i%p==0:
- return 0
- return 1
- i=3
- n=1
- while 1>0:
- if is_prime(i):
- n=n+1
- if n==10001:
- break
- i=i+2
- print i
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement