Problem 60. The Goldbach Conjecture

Solution 349809

Submitted on 12 Nov 2013

Size: 29
Leading solution size is 8.

This solution is locked. To view this solution, you need to provide a solution of the same size or smaller.

1 Comment

1 Comment

Alexandre on 12 Nov 2013

It would be interesting that the test suite does the assertion on all entries of p1 & p2 in case they return all possible solutions.

assert(all(isprime(p1) & isprime(p2) & (p1+p2==n))

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

Test

Status

Code Input and Output

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

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.

Problem 60. The Goldbach Conjecture

Test Suite

Suggested Problems

More from this Author95

Problem 60. The Goldbach Conjecture

Test Suite

Suggested Problems

More from this Author95

Players