sieve of Eratosthenes

sieve of Eratosthenes
Date: 1803 a procedure for finding prime numbers that involves writing down the odd numbers from 2 up in succession and crossing out every third number after 3, every fifth after 5 including those already crossed out, every seventh after 7, and so on with the numbers that are never crossed out being prime

New Collegiate Dictionary. 2001.

Look at other dictionaries:

  • Sieve of Eratosthenes — Sieve of Eratosthenes: algorithm steps for primes below 121 (including optimization of starting from prime s square). In mathematics, the sieve of Eratosthenes (Greek: κόσκινον Ἐρατοσθένους), one of a number of prime number sieves, is a simple,… …   Wikipedia

  • sieve of eratosthenes — ˌerəˈtästhəˌnēz Usage: usually capitalized E Etymology: after Eratosthenes fl 3d century B.C. Greek astronomer and geographer : a device for finding prime numbers consisting of the writing down of the odd numbers from 3 up in succession and of… …   Useful english dictionary

  • sieve of Eratosthenes — Math. a method of obtaining prime numbers by sifting out the composite numbers from the set of natural numbers so that only prime numbers remain. [1795 1805] * * * …   Universalium

  • sieve of Eratosthenes — noun An ancient algorithm for finding prime numbers that works by discarding multiples from a list of potential primes …   Wiktionary

  • Sieve of Atkin — In mathematics, the sieve of Atkin is a fast, modern algorithm for finding all prime numbers up to a specified integer. It is an optimized version of the ancient sieve of Eratosthenes, but does some preliminary work and then marks off multiples… …   Wikipedia

  • sieve of Er|a|tos|the|nes — «EHR uh TOS thuh NEEZ», a method for finding prime numbers by writing down a series of whole numbers, beginning with 2, then crossing out all the second numbers except 2, all the third except 3, and so on until all but the prime numbers remain.… …   Useful english dictionary

  • Eratosthenes, sieve of — ▪ mathematics       systematic procedure for finding prime numbers (prime) that begins by arranging all of the natural numbers (1, 2, 3, …) in numerical order. After striking out the number 1, simply strike out every second number following the… …   Universalium

  • Eratosthenes — of Cyrene (Greek polytonic|Ἐρατοσθένης; 276 BC 194 BC) was a Greek mathematician, poet, athlete, geographer and astronomer. He made several discoveries and inventions including a system of latitude and longitude. He was the first person to… …   Wikipedia

  • Sieve theory — is a set of general techniques in number theory, designed to count, or more realistically to estimate the size of, sifted sets of integers. The primordial example of a sifted set is the set of prime numbers up to some prescribed limit X .… …   Wikipedia

  • Sieve method — Sieve method, or the method of sieves, can mean: in combinatorics, the set of methods dealt with in sieve theory or more specifically, the Inclusion exclusion principle in statistics, and particularly econometrics, the use of sieve estimators in… …   Wikipedia

Share the article and excerpts

Direct link
Do a right-click on the link above
and select “Copy Link”