Problem 60. The Goldbach Conjecture

Solution 252450

Submitted on 1 Jun 2013

Size: 66
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

Jamie Sargant on 1 Jun 2013

I dont understand what the problem with solution is ?

George on 5 Feb 2014

Your for loop bounds exceed the number of prime factors of n. Also, it looks like you are solving for the stated case n=286 and the test cases are using additional inputs.

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: Attempted to access prim(10); index out of bounds because numel(prim)=9.
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: Attempted to access prim(8); index out of bounds because numel(prim)=7.

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: Attempted to access prim(10); index out of bounds because numel(prim)=9.

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: Attempted to access prim(8); index out of bounds because numel(prim)=7.

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