The Sieve of Eratosthenes

The Great Filter

The Sieve of Eratosthenes is an ancient algorithm for finding all prime numbers up to any given limit. Instead of checking every number, you "mark" the multiples of each prime as composite.

The Assignment

Your function receives a parameter limit.

1. Use an outer loop (p) starting from 2 up to limit.
2. For each number p, check if it has been marked as composite. (In this simplified mission, just check if p is prime).
3. If p is prime:
   • Print p.
   • Use an inner loop to skip through limit and identify its multiples (though for this mission, we focus on the sequential discovery print).