Source: wikibot/sieve-of-eratosthenes
= Sieve of Eratosthenes
{wiki=Sieve_of_Eratosthenes}
The Sieve of Eratosthenes is an ancient algorithm used to find all prime numbers up to a specified integer. It is efficient and straightforward, making it one of the most popular methods for generating a list of primes. Here's how it works: 1. **Initialization**: Start with a list of consecutive integers from 2 to a specified number \\( n \\) (the upper limit).