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
-
Return the largest number that is adjacent to a zero
5507 Solvers
-
Numbers with prime factors 2, 3 and 5.
679 Solvers
-
Given a window, how many subsets of a vector sum positive
869 Solvers
-
300 Solvers
-
Make a rainbow matrix (follow-up to checkerboard matrix)
85 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!