Problem 45367. Sieve of Eratosthenes - 02
"Sift the Two's and Sift the Three's, The Sieve of Eratosthenes. When the multiples sublime, The numbers that remain are Prime." ...anonymous
Sieve of Eratosthenes is a simple but ingenious ancient algorithm for finding all prime numbers up to n.
given a limit n, u've to find all the primes up to n. The built-in prime function of matlab is restricted.
Solution Stats
Problem Comments
Solution Comments
Show commentsProblem Recent Solvers128
Suggested Problems
-
Remove the small words from a list of words.
1559 Solvers
-
287 Solvers
-
306 Solvers
-
Who knows the last digit of pi?
688 Solvers
-
Find my daddy long leg (No 's')
2711 Solvers
More from this Author174
Problem Tags
Community Treasure Hunt
Find the treasures in MATLAB Central and discover how the community can help you!
Start Hunting!