Sieve of Eratosthenes

- Mathematics & Logic -
Pure Mathematics Dictionary
A classical sieving algorithm that enumerates all prime numbers up to a bound N by iteratively marking as composite the multiples of each prime starting from 2, leaving unmarked numbers as primes.