Cody

# Problem 60. The Goldbach Conjecture

Solution 261998

Submitted on 16 Jun 2013 by Joe
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 = 1 p1 = 5 p2 = 23 i = 1 p1 = 3 p2 = 31 i = 1 p1 = 3 p2 = 37 i = 1 p1 = 3 p2 = 43 i = 1 p1 = 5 p2 = 47 i = 1 p1 = 5 p2 = 53 i = 1 p1 = 3 p2 = 61 i = 1 p1 = 3 p2 = 67 i = 1 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

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

### Community Treasure Hunt

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

Start Hunting!