Sieve of Eratosthenes - 02 - MATLAB Cody - MATLAB Central

Problem 45367. Sieve of Eratosthenes - 02

Difficulty:
(10)
Rate
 "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.

Solve

Solution Stats

40.0% Correct | 60.0% Incorrect
Last Solution submitted on Nov 04, 2024

Problem Comments

Solution Comments

Show comments
Who Deserves Your Praise? Discover the New Contribution Widget!
...
We are excited to announce another update to our Discussions area: the...

Problem Recent Solvers18

Suggested Problems

More from this Author165

Problem Tags

algorithm primes sequence

Community Treasure Hunt

Find the treasures in MATLAB Central and discover how the community can help you!

Start Hunting!
Go to top of page