Prime numbers play an important role in modern encryption methods, which is why it is especially important in computer science to know how to find primes.

In this tutorial we want to use one of the most common algorithms to find all primes up to a defined limit. For this we use the so-called “Sieve of Eratosthenes” (see Wikipedia).