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 Solvers113
Suggested Problems
-
Set the array elements whose value is 13 to 0
1429 Solvers
-
462 Solvers
-
Is this triangle right-angled?
6364 Solvers
-
Back to Basics - Find no. of elements in a matrix?
324 Solvers
-
find "greatest common divisor" of two integer value
198 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!