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 Solvers128
Suggested Problems
-
7849 Solvers
-
Increment a number, given its digits
680 Solvers
-
Convert a numerical matrix into a cell array of strings
2365 Solvers
-
Calculate the Number of Sign Changes in a Row Vector (No Element Is Zero)
895 Solvers
-
Is this triangle right-angled?
6513 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!