Cody

Problem 60. The Goldbach Conjecture

Solution 696912

Submitted on 7 Jul 2015
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

p1 = 5 11 17 23 p2 = 23 17 11 5

Operands to the || and && operators must be convertible to logical scalar values.

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

p1 = 5 7 11 13 p2 = 13 11 7 5

Operands to the || and && operators must be convertible to logical scalar values.

Suggested Problems

More from this Author95