In mathematics , the sieve of Eratosthenes ( Greek : κόσκινον Ἐρατοσθένους ) , one of a number of prime number sieves , is a simple , ancient algorithm for finding all prime numbers up to any given limit .
In mathematics , the sieve of Eratosthenes ( Greek : κόσκινον Ἐρατοσθένους ) is a simple , ancient algorithm for finding all prime numbers up to a specified integer .