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 Solvers18
Suggested Problems
-
Find the sum of all the numbers of the input vector
47675 Solvers
-
Program an exclusive OR operation with logical operators
707 Solvers
-
Project Euler: Problem 6, Natural numbers, squares and sums.
2106 Solvers
-
Remove element(s) from cell array
1472 Solvers
-
Mysterious digits operation (easy)
276 Solvers
More from this Author165
Problem Tags
Community Treasure Hunt
Find the treasures in MATLAB Central and discover how the community can help you!
Start Hunting!