PY
py
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
import math
primes = [2] # need at least to be initializated with one prime value
def is_prime(x):
global primes
if x == 0 or x == 1:
return False
if x in primes:
return True
srx = math.sqrt(x)
p = 0
for p in primes:
if p > srx:
primes.append(x)
return True
if x % p == 0:
return False
for y in range(p+1,round(srx)):
if is_prime(y):
primes.append(y)
if x % y == 0:
return False
return True
while True:
try:
i = int(input("How many prime numbers ( none for exit )? "))
except:
Enter to Rename, Shift+Enter to Preview
OUTPUT
Run