Proper noun
sieve of Eratosthenes
(mathematics) An ancient algorithm for finding prime numbers that works by discarding multiples from a list of potential primes.
History The Sieve of Eratosthenes is a simple algorithm for finding all prime numbers up to a specified integer. Source: Internet
In 240 BC, Eratosthenes used the Sieve of Eratosthenes to quickly isolate prime numbers. Source: Internet
The Sieve of Eratosthenes, attributed to Eratosthenes, is a simple method to compute primes, although the large primes found today with computers are not generated this way. Source: Internet