Problem 45367. Sieve of Eratosthenes - 02

• Created by Asif Newaz
• Appears in 2 groups

×

By solving this problem, you will make progress in the following group(s)

Magic Numbers IV

• 20 Problems
• 24 Finishers

Project Euler IV

• 11 Problems
• 16 Finishers

Like (2)

Difficulty:

(17)

Rate

• Solve Later   
• Add To GroupÂ

 "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

• 50 Solutions
• 18 Solvers

Last Solution submitted on Nov 04, 2024

Last 200 Solutions

Solution Comments

ANNOUNCEMENT ×

Registration Now Open for MathWorks AUTOMOTIVE CONFERENCE 2025

Hello Community, We're excited to announce that registration is now open for the...

Problem Recent Solvers18

Suggested Problems

• Find the sum of all the numbers of the input vector

  50760 Solvers

• Test if two numbers have the same digits

  247 Solvers

• Dimensions of a rectangle

  5385 Solvers

• Sum My Indices

  166 Solvers

• Draw 'E'

  979 Solvers

More from this Author165

• Fault in our Stars - 01

  17 Solvers

• Exponentiation

  27 Solvers

• Orthogonal Circles

  12 Solvers

• Castling-01

  14 Solvers

• String count

  18 Solvers