# Sieve of Eratosthenes

Also found in: Wikipedia.

## sieve of Eratosthenes

[′siv əv ‚er·ə′täs·thə‚nēz]
(mathematics)
An iterative procedure which determines all the primes less than a given number.

## Sieve of Eratosthenes

A benchmark program used to test the mathematical speed of a computer. The program calculates prime numbers based on Eratosthenes's algorithm.
Mentioned in ?
References in periodicals archive ?
While many students will have seen application of the Sieve of Eratosthenes (http:// en.
With Chartworld, children can easily create models showing: multiples, the commutative property of multiplication, perfect squares, division as the inverse of multiplication, division with remainder, factors, prime numbers, divisibility tests, and the Sieve of Eratosthenes.
The Sieve of Eratosthenes is a classic mathematical concept, used to generate the prime numbers.
With Chartworld, it is easy for a teacher to introduce the Sieve of Eratosthenes.
As a result of creating the Sieve of Eratosthenes, children discover a very important property of prime numbers.
Topics include the role of number theory in mathematics education research, understanding number theory's relationship with algebra and arithmetic, appreciating multiplicative structures, repeating patterns, using the Sieve of Eratosthenes in the elementary grades, learning number theory through a chain of discovery, learning number theory in a calculator environment and through geometrical interactive computer programs, problem solving, and revising algebra in a number theory setting.
The sieve of Eratosthenes represents a systematic way of checking whether a number is a prime by dividing into the given number all smaller primes, starting with two and going up to the square root of the target number.
The efficiency of the venerable sieve of Eratosthenes, for example, is related to the number of trial divisions required to test a given integer for primality.
This C program implements a Sieve of Eratosthenes for computing all primes less than n.
Although the earliest prime numbers are listed in many mathematical reference books, your students can discover them by using the method known as the Sieve of Eratosthenes, named after the Greek geographer and astronomer who lived from c.
This method is called the Sieve of Eratosthenes, named after Eratosthenes (who lived in the third century BC), but is obviously not practical for larger numbers.

Site: Follow: Share:
Open / Close