Cody

Problem 2337. Sum of big primes without primes

Solution 1977486

Submitted on 15 Oct 2019 by Paul Morant
This solution is locked. To view this solution, you need to provide a solution of the same size or smaller.
Solve This Problem View on Solution Map

Test Suite

Test Status Code Input and Output
1   Pass
x = 10; y_correct = 17; assert(isequal(big_euler10(x),y_correct))

y = 17
2   Pass
x = 100; y_correct = 1060; assert(isequal(big_euler10(x),y_correct))

y = 1060
3   Pass
x = 1000; y_correct = 76127; assert(isequal(big_euler10(x),y_correct))

y = 76127
4   Pass
x = 10000; y_correct = 5736396; assert(isequal(big_euler10(x),y_correct))

y = 5736396
5   Pass
x = 100000; y_correct = 454396537; assert(isequal(big_euler10(x),y_correct))

y = 454396537
6   Pass
x = 1000000; y_correct = 37550402023; assert(isequal(big_euler10(x),y_correct))

y = 3.7550e+10
7   Pass
x = 1000000-100; y_correct = 37542402433; assert(isequal(big_euler10(x),y_correct))

y = 3.7542e+10
8   Pass
x = 2000000-1000; y_correct = 142781862782; assert(isequal(big_euler10(x),y_correct))

y = 1.4278e+11

Suggested Problems

More from this Author43