Answer can be found in the back of the book.
The Sieve of Archimeds is amethod of determining all primes less than or equal to a given natural number n.
We need at least 10 more requests to produce the solution.
0 / 10 have requested this problem solution
The more requests, the faster the answer.