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.

Solve

Solution Stats

61.93% Correct | 38.07% Incorrect
Last Solution submitted on Jan 01, 2026

Problem Comments

Solution Comments

Show comments

Problem Recent Solvers113

Suggested Problems

More from this Author174

Problem Tags

algorithm primes sequence

Community Treasure Hunt

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

Start Hunting!