Question

sieve of Erasthosthenes ​

Answer 1

Heya....❤❤❤

here is ur answer....

In mathematics, the sieve of Eratosthenes is a simple, ancient algorithm for finding all prime numbers up to any given limit. It does so by iteratively marking as composite the multiples of each prime, starting with the first prime number, 2.

hope it helps...

plzz mark me as brainliest my dear !!!

❤❤❤

Answer 2

$\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.