Problem 250. Project Euler: Problem 10, Sum of Primes
Solution Stats
Problem Comments
-
7 Comments
The test suite could match the problem statement more closely if it would test an input that was also prime. One would expect that if the input is 7, the output would be 2 + 3 + 5 since 7 is not "below" 7?
The code "sum(find((isprime(1:x))))" works well on my own computer,but in cody it keeps says "While evaluating the solution, the server encountered an error caused by long running MATLAB code. Edit the code if needed and then rescore." I don't know why, is the test x=2000000 too large!?
@Lin,
I think it is timing out. Why are you making your own tests anyways?
I think, in last test, x=11; answer must be 17. less then given number....
Use primes :: server encountered an error
Pritesh Shah, you are correct. Well done for spotting this when many others didn't! It could be classified as a problem with the Test Suite, but given that this is tagged as "basic matlab" it may be more fitting to amend the problem statement.
As suggested by David Verrelli on 15-Dec-2017, I have edited the problem statement to reconcile it with the test suite. For everyone's reference, the original problem statement was:
The sum of the primes below 10 is 2 + 3 + 5 + 7 = 17.
Find the sum of all the primes below the input, N.
But that problem statement didn't match one of the test suite cases.
Since I didn't change the test suite, the solutions did not need to be rescored.
Solution Comments
-
1 Comment
Below and equal to N *
Problem Recent Solvers1124
Suggested Problems
-
251 Solvers
-
The Hitchhiker's Guide to MATLAB
3057 Solvers
-
230 Solvers
-
441 Solvers
-
323 Solvers
More from this Author51
Problem Tags
Community Treasure Hunt
Find the treasures in MATLAB Central and discover how the community can help you!
Start Hunting!