Cody

# Problem 2337. Sum of big primes without primes

Solution 483763

Submitted on 7 Aug 2014 by Binbin Qi
This solution is locked. To view this solution, you need to provide a solution of the same size or smaller.

### Test Suite

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

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

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

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

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

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

7   Pass
%% x = 1000000-100; y_correct = 37542402433; assert(isequal(big_euler10(x),y_correct))

8   Pass
%% x = 2000000-1000; y_correct = 142781862782; assert(isequal(big_euler10(x),y_correct))

9   Pass
%% Solution of Project Euler 10 with n=2000000