
Educators: Earn a free Gold upgrade by joining the PBwiki Back To School Challenge.

Questions? Join PBwiki's weekly office hours today at 1 PM Eastern and get live answers.
The Sieve of Eratosthenes
While researching Eratosthenes (born in 276BC in
The sieve of Eratosthenes is an algorithm used to locate all prime numbers from one to a specified maximum number, n. It involves a chart from one to n with x rows and y columns. In order to go through all prime numbers within that range (1 to n, where n is the maximum number) the user must locate and remove from the chart all of the multiples of the numbers in the first row. As a result, the chart will contain only prime numbers from one to n.
Eratosthenes was highly regarded in the ancient world, but unfortunately only fragments of his writing have survived. For example, as written by Quesada, “several improvements have been made to the Sieve by reducing the size of the initial set and by avoiding some duplication in the removal process.” However, if it was not for Eratosthenes, there probably would never have been a table of primes, or any quicker algorithm for locating prime numbers within a range of numbers.
In 195BC, Eratosthenes died at a very old age by voluntarily starving himself, due to despair at his blindness.
Works Cited
Antonio R. Quesada, “On the K-th extension of the Sieve of eratosthenes,” International Journal of Mathematics and Mathematical Sciences, vol. 18, no. 3, pp. 539-544, 1995. doi:10.1155/S0161171295000688
Moulton, J. Paul. "Sieve of Eratosthenes." The Gale Encyclopedia of Science. Ed. K. Lee Lerner and Brenda Wilmoth Lerner. Vol. 5. 3rd ed.
Baldwin, Doug, and Greg Scragg. Algorithms and Data Structures: The Science of Computing.
Page Information
|
Wiki Information |
Recent PBwiki Blog Posts |