# 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 10001st prime number?

load("lib/primality.jl")

# Find N so that N / ln(N) > 10001
# 500_000 / log(500_000)
# Definitely sufficient.

primes = sieve_of_erasthanes(500_000)
primes[10001]