Cody

# Problem 60. The Goldbach Conjecture

Solution 1332388

Submitted on 8 Nov 2017 by Heiko
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

i = 9 j = 3 p1 = 23 p2 = 5 i = 11 j = 2 p1 = 31 p2 = 3 i = 12 j = 2 p1 = 37 p2 = 3 i = 14 j = 2 p1 = 43 p2 = 3 i = 15 j = 3 p1 = 47 p2 = 5 i = 16 j = 3 p1 = 53 p2 = 5 i = 18 j = 2 p1 = 61 p2 = 3 i = 19 j = 2 p1 = 67 p2 = 3 i = 21 j = 2 p1 = 73 p2 = 3

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

i = 6 j = 3 p1 = 13 p2 = 5 i = 7 j = 2 p1 = 17 p2 = 3 i = 8 j = 2 p1 = 19 p2 = 3 i = 25 j = 2 p1 = 97 p2 = 3 i = 25 j = 3 p1 = 97 p2 = 5 i = 29 j = 3 p1 = 109 p2 = 5 i = 168 j = 2 p1 = 997 p2 = 3 i = 302 j = 2 p1 = 1997 p2 = 3 i = 11 j = 3 p1 = 31 p2 = 5 i = 503 j = 4 p1 = 3593 p2 = 7

### Community Treasure Hunt

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

Start Hunting!