Question

What is Sieve of Eratosthenes​

Answer 1

Step-by-step explanation:

In mathematics, the sieve of Eratosthenes is an ancient algorithm for finding all prime numbers up to any given limit. It does so by iteratively marking as composite (i.e., not prime) the multiples of each prime, starting with the first prime number, 2. ... It may be used to find primes in arithmetic progressions.

Answer 2

Answer:

In mathematics, the sieve of Eratosthenes is an ancient algorithm for finding all prime numbers up to any given limit. It does so by iteratively marking as composite (i.e., not prime) the multiples of each prime, starting with the first prime number, 2. ... It may be used to find primes in arithmetic progressions.