Sieve of Sundaram
Sieve of Sundaram
Common
Rarity: Common
The most frequent rarity: most Wikipedia articles become Commons.
Rarity follows how well known the article is: its views on the French and English Wikipedia over a year, and the number of languages it exists in.
At a glance
- Class
- Notion
- Domain
- Science and technology
- In collections
- Nobody has pulled it yet.
What Wikipedia says
In mathematics, the sieve of Sundaram is a variant of the sieve of Eratosthenes, a simple deterministic algorithm for finding all the prime numbers up to a specified integer. It was discovered by Indian student S. P. Sundaram in 1934.
Excerpt from the Wikipedia article “Sieve of Sundaram”, under the CC BY-SA 4.0 license. Read the article on Wikipedia
Open free boosters and add Sieve of Sundaram to your collection.
Play for free




