Cody

Problem 60. The Goldbach Conjecture

Solution 1134355

Submitted on 6 Mar 2017 by Matteo Raso
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

lenp = 9 p1 = 11 p2 = 17 lenp = 11 p1 = 17 p2 = 17 lenp = 12 p1 = 17 p2 = 23 lenp = 14 p1 = 23 p2 = 23 lenp = 15 p1 = 23 p2 = 29 lenp = 16 p1 = 29 p2 = 29 lenp = 18 p1 = 23 p2 = 41 lenp = 19 p1 = 29 p2 = 41 lenp = 21 p1 = 29 p2 = 47

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

lenp = 7 p1 = 7 p2 = 11 lenp = 8 p1 = 7 p2 = 13 lenp = 8 p1 = 11 p2 = 11 lenp = 25 p1 = 47 p2 = 53 lenp = 26 p1 = 43 p2 = 59 lenp = 30 p1 = 53 p2 = 61 lenp = 168 p1 = 491 p2 = 509 lenp = 303 p1 = 991 p2 = 1009 lenp = 11 p1 = 17 p2 = 19 lenp = 503 p1 = 1789 p2 = 1811