"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 Solvers154
Suggested Problems
-
16210 Solvers
-
Find all elements less than 0 or greater than 10 and replace them with NaN
15808 Solvers
-
Project Euler: Problem 6, Natural numbers, squares and sums.
2577 Solvers
-
Back to basics 3 - Temp Directory
387 Solvers
-
Return unique values without sorting
1019 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!