"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
-
Given an unsigned integer x, find the largest y by rearranging the bits in x
2078 Solvers
-
Convert a vector into a number
621 Solvers
-
378 Solvers
-
Find out sum and carry of Binary adder
1852 Solvers
-
Van Eck's Sequence's nth member
333 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!