Cody

# Problem 60. The Goldbach Conjecture

Solution 1058571

Submitted on 22 Nov 2016 by BluePoseidon1643
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

b = 3 p1 = 5 p2 = 23 b = 3 p1 = 17 p2 = 17 b = 3 p1 = 11 p2 = 29 b = 3 p1 = 29 p2 = 17 b = 3 p1 = 29 p2 = 23 b = 3 p1 = 29 p2 = 29 b = 3 p1 = 5 p2 = 59 b = 3 p1 = 41 p2 = 29 b = 3 p1 = 5 p2 = 71

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

b = 3 p1 = 13 p2 = 5 b = 3 p1 = 17 p2 = 3 b = 3 p1 = 11 p2 = 11 b = 3 p1 = 59 p2 = 41 b = 3 p1 = 61 p2 = 41 b = 3 p1 = 73 p2 = 41 b = 3 p1 = 17 p2 = 983 b = 3 p1 = 1009 p2 = 991 b = 3 p1 = 7 p2 = 29 b = 3 p1 = 1823 p2 = 1777