Question

sieve of eratosthenes

Answer 1

in mathematics the sieve of eratosthense is a simple ancient algorithm for finding all prime number up to any giving limit one of a prime number sieve it is one of most affient way to find all of the smaller prime number.

Answer 2

Sieve of eratosthenes is a simple and ancient algorithm used to find prime number up to amy given limits. It is one of the most efficient way to fimd small prime number.
For a given uplimit n is the algorithms works its iteractively marking the multiples of prime as composite,starting from 2.