Cody

Problem 60. The Goldbach Conjecture

Solution 3827818

Submitted on 25 Nov 2020
This solution is locked. To view this solution, you need to provide a solution of the same size or smaller.
Solve This Problem View on Solution Map

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

Error in solution: Line: 13 Column: 1 This statement is not inside any function. (It follows the END that terminates the definition of the function "goldbach".)
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

Error in solution: Line: 13 Column: 1 This statement is not inside any function. (It follows the END that terminates the definition of the function "goldbach".)

Suggested Problems

More from this Author95

Community Treasure Hunt

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

Start Hunting!