"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 comments
Loading...
Problem Recent Solvers162
Suggested Problems
-
Find all elements less than 0 or greater than 10 and replace them with NaN
15818 Solvers
-
7504 Solvers
-
Project Euler: Problem 10, Sum of Primes
2130 Solvers
-
Replace multiples of 5 with NaN
472 Solvers
-
Solve a System of Linear Equations
14937 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!