Problem 45367. Sieve of Eratosthenes - 02
"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 commentsProblem Recent Solvers125
Suggested Problems
-
Back to basics 18 - justification
205 Solvers
-
Create a vector whose elements depend on the previous element
776 Solvers
-
300 Solvers
-
5774 Solvers
-
String Array Basics, Part 1: Convert Cell Array to String Array; No Missing Values
1947 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!