Editing SieveOfEratosthenes
You are currently browsing as guest..
To change this, fill in the following fields:
Username
Password
Click here to reset your password
Who can read this page?
The World
Members
Council
Admin
You have been granted an edit lock on this page
until Sat Apr 20 09:00:44 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.