include("euler.jl")
function find_next_prime(primes)
= primes[end]
n while true
+= 2
n
= false
not_prime
for q ∈ primes
= Euler.divides(q, n)
not_prime if not_prime
break
end
end
if not_prime
continue
end
return(n)
end
end;
function find_n_primes(n::Integer)
= [2, 3]
primes while length(primes) < n
= find_next_prime(primes)
next_prime push!(primes, next_prime)
end
return primes
end;
p7() = find_n_primes(10_001)[end];
p7()
104743