"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 comments
Loading...
Problem Recent Solvers165
Suggested Problems
-
Find the longest sequence of 1's in a binary sequence.
6866 Solvers
-
Approximation of Pi (vector inputs)
285 Solvers
-
Height of a right-angled triangle
2105 Solvers
-
Make a rainbow matrix (follow-up to checkerboard matrix)
92 Solvers
-
9874 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!