Can anyone give a thrall explain eratosthenes’ sieve

See below  

Step-by-step explanation:

The sieve of Eratosthenes is a stepwise method for finding all prime numbers up to a given number n.

Assume that you want to find all the prime numbers between 1 and 100.

Step 1.

Create a square grid with numbers from 1 to 100.

You will be finding numbers in the grid that are composite (not prime) and discarding them. The remaining numbers are the primes.

Step 2.

Mark 1, because it is not a prime.

Step 3.

2 is prime. Mark all multiples of 2, starting from 4 (green in the image below).

Step 4.

3 is prime. Mark all multiples of 3, starting from 9 (blue)

Step 5.

4 is composite, so, mark all multiples of 5, starting from 25 (orange).

Step 6.

6 is composite, so, mark all multiples of 7, starting from 49 (purple).

Step 7.

8, 9, and 10 are composite, and 11² > 100, so we can stop.

All the unmarked numbers are the prime numbers between 1 and 100:

2, 3, 5, 7, 11, 13, 17, 19, 23, 29, 31, 37, 41, 43, 47, 53, 59, 61, 67, 71, 73, 79, 83, 89, and 97.

answer: i believe c. is the answer sorry if i am wrong

step-by-step explanation:

∠lno ≅ ∠lnm

∠oln ≅ ∠mln

step-by-step explanation:

given   that triangle lno is congruent to triangle lnm.

we have to fill up the blanks in the given question.

according to above order of congruency   kept in mind we can say that

∠lno ≅ ∠lnm

∠oln ≅ ∠mln

ln ≅ ln due to common in both.

hence, by sas congruency,

the side angle side rule   states that if two sides and the included angle of one triangle are congruent to another triangle, then these two triangles are congruent.