"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
-
Project Euler: Problem 2, Sum of even Fibonacci
2841 Solvers
-
Create an n-by-n null matrix and fill with ones certain positions
718 Solvers
-
1719 Solvers
-
There are 10 types of people in the world
1290 Solvers
-
Find the next Fibonacci number
906 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!