Python solution to project euler problem 7 from here https://projecteuler.net/problem=7
In problem 3 we made a sieve to get the prime numbers less than N. It is pretty trivial to modify that to get a certain quantity of Prime numbers. That modification goes in the prime library as well.
All code
Copyright 2021 Google LLC
SPDX-License-Identifier: Apache-2.0
https://www.apache.org/licenses/LICEN...
The Snake image in the thumbnail - by Vecteezy https://www.vecteezy.com/vector-art/4...