How do you use the Sieve of Eratosthenes to find all the prime numbers less than 100?

Does anyone know what this problem is all about? I hate math~and I'm getting nowhere with this problem





Use the Sieve of Eratosthenes to find all the prime numbers less than 100.





a. What is the largest prime number that you will need to check to solve the problem?





How do you use the Sieve of Eratosthenes to find all the prime numbers less than 100?
Write out the numbers 1 - 100 in lines of ten. Put a box around the number one because it is neither prime nor composite - it is identity. Circle the numbers 2, 3, 5, 7, and 11.


Eliminate all composite numbers by crossing out multiples of 2, 3, 5. 7 and 11.


You should have 25 numbers that have not been crossed out. These are the primes between 1 and 100.How do you use the Sieve of Eratosthenes to find all the prime numbers less than 100?
http://en.wikipedia.org/wiki/Sieve_of_Er鈥?/a>





There is a link to the site and it has a little animation showing what happens and steps to do it yourself. I've never heard of this before and it's really really cool. Thanks for asking this.