Cody

# Problem 60. The Goldbach Conjecture

Solution 172005

Submitted on 3 Dec 2012 by Felix
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

p1 = 17 p2 = 11 p1 = 23 p2 = 11 p1 = 23 p2 = 17 p1 = 29 p2 = 17 p1 = 29 p2 = 23 p1 = 41 p2 = 17 p1 = 41 p2 = 23 p1 = 41 p2 = 29 p1 = 47 p2 = 29

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

p1 = 11 p2 = 7 p1 = 13 p2 = 7 p1 = 17 p2 = 5 p1 = 53 p2 = 47 p1 = 59 p2 = 43 p1 = 61 p2 = 53 p1 = 509 p2 = 491 p1 = 1009 p2 = 991 p1 = 19 p2 = 17 p1 = 1811 p2 = 1789

### Community Treasure Hunt

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

Start Hunting!