"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 Solvers152
Suggested Problems
-
Sum all integers from 1 to 2^n
17852 Solvers
-
Program an exclusive OR operation with logical operators
751 Solvers
-
11154 Solvers
-
Getting the indices from a vector
12237 Solvers
-
Replace values out of an interval with the lower or upper values
71 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!