Problem 2337. Sum of big primes without primes

Created by Jean-Marie Sainthillier
Appears in 2 groups

Difficulty:Rate

Solve Later
Add To GroupÃ‚

Inspired by Project Euler n°10 (I am quite obviously a fan).
With problem n°250 by Doug, you can find some global methods to compute the sum of all the primes below the input n.
For example, the sum of the primes below 10 is 2 + 3 + 5 + 7 = 17.
But how to proceed (in time) with big number and WITHOUT the primes function ?
HINTS: sum(primes(n)) is possible here but why miss the wonderfull Sieve of Eratosthenes ?
http://en.wikipedia.org/wiki/Sieve_of_Eratosthenes

Solve

Solution Stats

436 Solutions
143 Solvers

Last Solution submitted on Apr 21, 2025

Last 200 Solutions

Problem Comments

2 Comments

2 Comments

Rafael S.T. Vieira on 8 Aug 2020

Be careful, I've implemented the sieve, but not all versions of it are sufficiently fast to handle the biggest numbers in the test suite.

Yunpeng Teng on 7 Dec 2020

While evaluating the solution, the server encountered an error caused by long running MATLAB code. Edit the code if needed and then submit.

Solution Comments

Show comments

ANNOUNCEMENT

Registration Now Open for MathWorks AUTOMOTIVE CONFERENCE 2025

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

Group

Big Numbers

11 Problems
38 Finishers

Problem Recent Solvers143

Problem Tags

Community Treasure Hunt

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

Start Hunting!