"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 Solvers136
Suggested Problems
-
Arrange Vector in descending order
13350 Solvers
-
Sum of diagonal of a square matrix
1637 Solvers
-
Create a square matrix of multiples
498 Solvers
-
Remove entire row and column in the matrix containing the input values
555 Solvers
-
Fix the last element of a cell array
1761 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!