Cody

Problem 60. The Goldbach Conjecture

Solution 1864

Submitted on 26 Jan 2012
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 = 5 p2 = 23 p1 = 3 p2 = 31 p1 = 3 p2 = 37 p1 = 3 p2 = 43 p1 = 5 p2 = 47 p1 = 5 p2 = 53 p1 = 3 p2 = 61 p1 = 3 p2 = 67 p1 = 3 p2 = 73

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: Operands to the || and && operators must be convertible to logical scalar values.

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!