LYCOS RETRIEVER 
Eratosthenes: Numbers
built 607 days ago
Eratosthenes was the founder of scientific chronology; he endeavored to fix the dates of the chief literary and political events from the conquest of Troy. An important work was his treatise on the old comedy, dealing with theaters and theatrical apparatus generally, and discussing the works of the principal comic poets themselves. Works on moral philosophy, history, and a number of letters were ... attributed to him.
Source:
The sieve of Eratosthenes is a simple algorithm created by Eratosthenes, an ancient Greek mathematician, for finding all prime numbers up to a specified integer. The algorithm is often used to compare the syntax of programming languages and the speed of compilers, or interpreters.
Source:
Eratosthenes (275-194 B.C., Greece) devised a 'sieve' to discover prime numbers. A sieve is like a strainer that you drain spaghetti through when it is done cooking. The water drains out, leaving your spaghetti behind. Eratosthenes's sieve drains out composite numbers and leaves prime numbers behind.
Source:
Eratosthenes invented a method for efficiently constructing tables of prime numbers. This method, the "Sieve of Eratosthenes", It goes like this. First, write down a list of integers beginning with 2 and ending with some number, say, 20:
Source:
Eratosthenes is known as a great mathematician for finding the prime number sieve, now called the "Sieve of Eratosthenes". It's a way to find all prime numbers below a given integer. It works this way: let's say you want to find all prime numbers under 100. You write down all numbers from 1 to 100. Then you cancel all numbers devisable by 2 (every second number) except 2 itself. Then you cancel all numbers devisable by 3 (every third number) except the 3 itself.
Source:
More than 2000 years ago, the Greek mathematician Eratosthenes described a simple algorithm for finding prime numbers. This exercise involves using Eratosthenes’s algorithm in a “list of prime numbers” class, and then using an instance of that class to conduct an experiment concerning the number of prime numbers. The “list of prime numbers” class will be a subclass of the List class from chapter 11 of
Source:
MORE ABOUT
Numbers