Numbers Task 3.5

The Sieve of Eratosthenes is a simple algorithm for finding all prime numbers up to any given limit. It does this by striking out all the multiples of prime numbers such as 2, 3, 5 and 7. First we strike out the multiples of 2, then the multiples of 3, then the multiples of 5 and then the multiples of 7. What is left are the prime numbers.

The Prime numbers in this table have been underlined and the ones that are not prime and have been marked.