Editing SieveOfEratosthenes
You are currently not logged in.
To change this, fill in the following fields:
Username
Password
If you want a password, email topicsinmaths@solipsys.co.uk
Who can read this page?
The World
Members
Council
Admin
You have been granted an edit lock on this page
until Fri Mar 29 11:41:16 2024.
Press
to finish editing.
Who can edit this page?
World editing disabled
Members
Council
Admin
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 every second number * Circle the next number not crossed out (this is a prime number) and call it "p" ** Square p, giving EQN:p^2 and starting from there, cross out every EQN:p^{th} number * Repeat the last step until the square is larger than n All the remaining uncrossed numbers are also prime numbers. Note that this procedure does not use division.