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 Solvers127
Suggested Problems
-
Find the longest sequence of 1's in a binary sequence.
6668 Solvers
-
Which values occur exactly three times?
5233 Solvers
-
500 Solvers
-
Project Euler: Problem 6, Natural numbers, squares and sums.
2530 Solvers
-
Calculate the area of a triangle between three points
3404 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!