"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 Solvers162
Suggested Problems
-
6464 Solvers
-
Find the peak 3n+1 sequence value
2573 Solvers
-
Remove the polynomials that have positive real elements of their roots.
1743 Solvers
-
Project Euler: Problem 16, Sums of Digits of Powers of Two
187 Solvers
-
Matrix with different incremental runs
131 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!