Cody

# Problem 60. The Goldbach Conjecture

Solution 2945929

Submitted on 14 Sep 2020
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   Fail
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

Unable to perform assignment because the indices on the left side are not compatible with the size of the right side. Error in goldbach (line 23) P(jj)=ii; Error in Test1 (line 4) [p1,p2] = goldbach(n)

2   Fail
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

Unable to perform assignment because the indices on the left side are not compatible with the size of the right side. Error in goldbach (line 23) P(jj)=ii; Error in Test2 (line 4) [p1,p2] = goldbach(n)

### Community Treasure Hunt

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

Start Hunting!