17 lines
395 B
Python
17 lines
395 B
Python
import math
|
|
|
|
primeCounter = 0
|
|
currentNumber = 1
|
|
|
|
def is_prime(maybeprime):
|
|
for i in range(2, math.floor(math.sqrt(maybeprime) + 1)):
|
|
if maybeprime % i == 0:
|
|
return False
|
|
return True
|
|
|
|
while primeCounter <= 10000:
|
|
currentNumber += 1
|
|
if is_prime(currentNumber):
|
|
primeCounter += 1
|
|
|
|
print("Prime number " + str(primeCounter) + " is: " + str(currentNumber)) |