An algorithm for finding prime numbers. It is often used as a benchmark in testing the speed of a computer or programming language. See also benchmark.
A procedure for finding prime numbers that involves writing down the odd numbers from 2 up in succession and crossing out every third number after 3, every fifth after 5 including those already crossed out, every seventh after 7, and so on with the numbers that are never crossed out being prime
Koncept u programiranju za pronalaženje prostih brojeva (broj koji nije deljiv nijednim brojem osim samim sobom i jedinicom), nazvan po jednom starom Grku. Koristi se u testovima softvera.