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
-
Find the longest sequence of 1's in a binary sequence.
6670 Solvers
-
16260 Solvers
-
202 Solvers
-
String Array Basics, Part 1: Convert Cell Array to String Array; No Missing Values
1948 Solvers
-
Calculate the average value of the elements in the array
1648 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!