WW

HEADERS_END

Eratosthenes, an ancient Greek Mathematician, developed a simple algorithm for finding prime numbers less than a desired number.

* Draw a table of all numbers less than the desired number n

* Draw a circle around the number 2

** Square 2 giving 4, then starting at 4, cross out

* Circle the next number not crossed out (this is a prime number)

** Square p, giving EQN:p^2 and starting from there, cross out

* Repeat the last step until

All the remaining uncrossed numbers are also prime numbers.