Sieve of Eratosthenes

The Sieve of Eratosthenes is a simple method to find all prime numbers up to a certain limit. Imagine writing all numbers from 2 to your target number. Start with the first number, 2, and eliminate all its multiples (like 4, 6, 8), since they are not prime. Move to the next remaining number, 3, and eliminate all its multiples. Repeat this process for each remaining number. By the end, the numbers that haven't been eliminated are prime. It’s an efficient way to identify prime numbers using a systematic, step-by-step elimination.