Question

$\textbf{Sieve of Erasthosthenes }$​

Answer 1

$\textbf{Sieve of Erasthosthenes }$:

This method helps us to find out Prime number from 1 to n.

Procedure :

Write all natural numbers from 1 to n.

1. The first Prime number is 2, leave 2 and round off all the multiples of 2. They are 4, 6,8... the next Prime number left is 3.

2. Round off all the multiple sof 3 except 3.

3. We have to continue this process up-to the highest Prime number which don't exceed √n.

Answer 2

hey there : )

========================

In mathematics, the sieve of Eratosthenes is a simple, ancient algorithm for finding all prime numbers up to any given limit. ... One of a number of prime number sieves, it is one of the most efficient ways to find all of the smaller primes.

=============================

hope it helps ^_^