Cody

# Problem 60. The Goldbach Conjecture

Solution 870323

Submitted on 11 Apr 2016 by Ravi
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

ind = 3 p1 = 5 p2 = 23 ind = 2 p1 = 3 p2 = 31 ind = 2 p1 = 3 p2 = 37 ind = 2 p1 = 3 p2 = 43 ind = 3 p1 = 5 p2 = 47 ind = 3 p1 = 5 p2 = 53 ind = 2 p1 = 3 p2 = 61 ind = 2 p1 = 3 p2 = 67 ind = 2 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

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