#!/usr/bin/env python3

# 10001st prime
# Problem 7
#
# By listing the first six prime numbers: 2, 3, 5, 7, 11, and 13, we can see that the 6th prime is 13.
#
# What is the 10 001st prime number?

from my_utils import is_prime

primesFound = 2
currentNumber = 3

while primesFound < 10001:
    currentNumber += 2
    if is_prime(currentNumber):
        primesFound += 1

print("Result:", currentNumber)

8249bbd5e2901118856d98d660bb3003710eb70d
<mask token>

<mask token>
while primesFound < 10001:
    currentNumber += 2
    if is_prime(currentNumber):
        primesFound += 1
print('Result:', currentNumber)

<mask token>
primesFound = 2
currentNumber = 3
while primesFound < 10001:
    currentNumber += 2
    if is_prime(currentNumber):
        primesFound += 1
print('Result:', currentNumber)

from my_utils import is_prime
primesFound = 2
currentNumber = 3
while primesFound < 10001:
    currentNumber += 2
    if is_prime(currentNumber):
        primesFound += 1
print('Result:', currentNumber)

#!/usr/bin/env python3

# 10001st prime
# Problem 7
#
# By listing the first six prime numbers: 2, 3, 5, 7, 11, and 13, we can see that the 6th prime is 13.
#
# What is the 10 001st prime number?

from my_utils import is_prime

primesFound = 2
currentNumber = 3

while primesFound < 10001:
    currentNumber += 2
    if is_prime(currentNumber):
        primesFound += 1

print("Result:", currentNumber)
