Problem7.py


1
2
3
4
5
6
7
8
9
10
11
12
13
14
15

def isprime(n):
    divisiors = []
    for x in range(2,(n)):
        if n%x == 0:
            return False
    return True
counter = 0
x = 2
while counter != 10001:
    if isprime(x):
        counter+=1
        print("prime number", counter, "is", x)
    x+=1
k=input("press close to exit")