Problem 2337. Sum of big primes without primes
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 ?
Solution Stats
Problem 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 commentsProblem Recent Solvers127
Suggested Problems
-
Return the 3n+1 sequence for n
8225 Solvers
-
17867 Solvers
-
4369 Solvers
-
Square Digits Number Chain Terminal Value (Inspired by Project Euler Problem 92)
216 Solvers
-
Is this triangle right-angled?
5623 Solvers
More from this Author43
Problem Tags
Community Treasure Hunt
Find the treasures in MATLAB Central and discover how the community can help you!
Start Hunting!