sieve of Eratosthenes
ancient algorithm for generating prime numbers
AI overview
The Sieve of Eratosthenes is an ancient method for finding all prime numbers up to a specified limit by systematically eliminating the multiples of each prime. It remains useful today as an efficient and straightforward way to generate lists of primes for mathematical and computational purposes.
AI-generated from the Wikipedia summary — may contain errors.
Wikidata facts
Show 2 more facts
- Commons category
- Sieve of Eratosthenes
- Stack Exchange tag
- stackoverflow.com/tags/sieve-of-eratosthenes
Sources (1)
via Wikidata · CC0
~14 min read
Article
Sieve of Eratosthenes: algorithm steps for primes below 121 (including optimization of starting from prime's square).
In mathematics, the sieve of Eratosthenes is an ancient algorithm for finding all prime numbers up to any given limit.