python newbie——PE No.7

第10001个质数是多少？

def primeQ(n):
    for i in range(2, int (n**0.5) + 1):
        if n % i == 0:
            return False
    return True

x = 1
n = 1
while n < 10001:
    x = x + 2
    if primeQ(x):
        n = n + 1
print x

>>>

104743