Cody

# Problem 60. The Goldbach Conjecture

Solution 312712

Submitted on 30 Aug 2013 by Danny Murphy
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
%% nList = 28:6:76; for i = 1:length(nList) n = nList(i); [p1,p2] = goldbach(n) assert(isprime(p1) && isprime(p2) && (p1+p2==n)); end

5 23 p1 = 5 p2 = 23 3 31 p1 = 3 p2 = 31 3 37 p1 = 3 p2 = 37 3 43 p1 = 3 p2 = 43 5 47 p1 = 5 p2 = 47 5 53 p1 = 5 p2 = 53 3 61 p1 = 3 p2 = 61 3 67 p1 = 3 p2 = 67 3 73 p1 = 3 p2 = 73

2   Pass
%% nList = [18 20 22 100 102 114 1000 2000 36 3600]; for i = 1:length(nList) n = nList(i); [p1,p2] = goldbach(n) assert(isprime(p1) && isprime(p2) && (p1+p2==n)); end

5 13 p1 = 5 p2 = 13 3 17 p1 = 3 p2 = 17 3 19 p1 = 3 p2 = 19 3 97 p1 = 3 p2 = 97 5 97 p1 = 5 p2 = 97 5 109 p1 = 5 p2 = 109 3 997 p1 = 3 p2 = 997 3 1997 p1 = 3 p2 = 1997 5 31 p1 = 5 p2 = 31 7 3593 p1 = 7 p2 = 3593

### Community Treasure Hunt

Find the treasures in MATLAB Central and discover how the community can help you!

Start Hunting!