"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 Solvers155
Suggested Problems
-
Numbers with prime factors 2, 3 and 5.
683 Solvers
-
Fix the last element of a cell array
1852 Solvers
-
Factorions: Numbers that equal the sum of the factorials of their digits
83 Solvers
-
Combined Ages 1 - Symmetric, n = 3
328 Solvers
-
2328 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!