"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 Solvers137
Suggested Problems
-
2417 Solvers
-
Given an unsigned integer x, find the largest y by rearranging the bits in x
1991 Solvers
-
500 Solvers
-
Find the sum of the elements in the "second" diagonal
1204 Solvers
-
Return elements unique to either input
808 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!