Prime Count Problem

The solution is to implement the sieve of Erastothenes.

The sieve of Eratosthenes is an ancient algorithm for finding all prime numbers up to any given limit.

Wikipedia: Sieve of Eratosthenes

3 Likes