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 Solvers110
Suggested Problems
-
27461 Solvers
-
Return the 3n+1 sequence for n
8475 Solvers
-
Numbers with prime factors 2, 3 and 5.
679 Solvers
-
Set some matrix elements to zero
615 Solvers
-
Create a vector whose elements depend on the previous element
773 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!