Problem 45367. Sieve of Eratosthenes - 02
"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 commentsProblem Recent Solvers18
Suggested Problems
-
13201 Solvers
-
Find the numeric mean of the prime numbers in a matrix.
8874 Solvers
-
Project Euler: Problem 5, Smallest multiple
1321 Solvers
-
Multiples of a Number in a Given Range
609 Solvers
-
Check if a matrix is a palindrome in all directions
101 Solvers
More from this Author165
Problem Tags
Community Treasure Hunt
Find the treasures in MATLAB Central and discover how the community can help you!
Start Hunting!