Prime Numbers
Eratosthenes also proposed a simple algorithm for finding prime numbers. This algorithm is known in mathematics as the Sieve of Eratosthenes.
In mathematics, the sieve of Eratosthenes (Greek: κόσκινον Ἐρατοσθένους), one of a number of prime number sieves, is a simple, ancient algorithm for finding all prime numbers up to any given limit. It does so by iteratively marking as composite (i.e. not prime) the multiples of each prime, starting with the multiples of 2. The multiples of a given prime are generated starting from that prime, as a sequence of numbers with the same difference, equal to that prime, between consecutive numbers. This is the sieve's key distinction from using trial division to sequentially test each candidate number for divisibility by each prime.
Read more about this topic: Eratosthenes
Famous quotes containing the words prime and/or numbers:
“I came there as prime steak and now I feel like low-grade hamburger.”
—Joycelyn Elders (b. 1933)
“Publishers are notoriously slothful about numbers, unless they’re attached to dollar signs—unlike journalists, quarterbacks, and felony criminal defendents who tend to be keenly aware of numbers at all times.”
—Hunter S. Thompson (b. 1939)