Problem 60. The Goldbach Conjecture

Solution 781094

Submitted on 19 Nov 2015

Size: 53
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.

Solve This Problem View on Solution Map

2 Comments

2 Comments

Lane Foulks on 19 Nov 2015

Can't use combnk()? Getting an error for using?

Lane Foulks on 19 Nov 2015

Oh, I can use nchoosek() instead...

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 Undefined function 'combnk' for input arguments of type 'double'.
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 Undefined function 'combnk' for input arguments of type 'double'.

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

Undefined function 'combnk' for input arguments of type 'double'.

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

Undefined function 'combnk' for input arguments of type 'double'.

Problem 60. The Goldbach Conjecture

Test Suite

Players