Problem 2337. Sum of big primes without primes
Solution Stats
Problem Comments
-
2 Comments
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.
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
-
2 Comments
This doesn't use primes(x),but still feels a little like cheating.
The whole point of using the sieve is not knowing which numbers are prime. So it is no different than sum(primes).
Problem Recent Solvers150
Suggested Problems
-
Project Euler: Problem 16, Sums of Digits of Powers of Two
119 Solvers
-
First non-zero element in each column
843 Solvers
-
middleAsColumn: Return all but first and last element as a column vector
562 Solvers
-
667 Solvers
-
Rounding off numbers to n decimals
2936 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!