"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 Solvers137
Suggested Problems
-
1359 Solvers
-
Back to basics 23 - Triangular matrix
1123 Solvers
-
Magic is simple (for beginners)
11224 Solvers
-
Rounding off numbers to n decimals
5538 Solvers
-
I'm going to enjoy watching you calculate, Mr Anderson
49 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!