Question

Date-
1.To find prime numbers from 1 to 100 by the method sieve of Eratosthenes.
Theory - To check whether a number less than 100 is a prime number or not, we have to
test its divisibility by 2,3,5 and 7 only.
Procedure-
Step 1 Take a grid of 10 by 10
Step 2 Write numbers from 1 to 100 in this grid.
Step 3 Cross out 1.
Step 4 Encircle 2 and cross out remaining multiples of 2 i.e. 4,6,8,10,.......100
Step 5 Encircle 3 and cross out remaining multiples of 3 i.e. 6,9,12,15,.......99
Step 6 Encircle 3 and cross out remaining multiples of 5 i.e. 10,15,20,25,....95
Step 7 Encircle 7 and cross out remaining multiples of 7 i.e. 14,21,28,35,...91
Step 8 Encircle each one of the remaining numbers.​

Answer 1

Answer:

wow it's nice .

plzz follow me.I am new here.

Answer 2

Answer:

thanks

Step-by-step explanation:

thanks very much