Cody

# Problem 64. The Goldbach Conjecture, Part 2

Solution 1913159

Submitted on 27 Aug 2019
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
n = 6; c_correct = 1; assert(isequal(goldbach2(n),c_correct))

t1 = 3 t2 = 3

2   Fail
n = 10; c_correct = 2; assert(isequal(goldbach2(n),c_correct))

t1 = 7 5 3 t2 = 3 5 7

Assertion failed.

3   Fail
n = 50; c_correct = 4; assert(isequal(goldbach2(n),c_correct))

t1 = 47 43 37 31 19 13 7 3 t2 = 3 7 13 19 31 37 43 47

Assertion failed.

4   Fail
n = 480; c_correct = 29; assert(isequal(goldbach2(n),c_correct))

t1 = Columns 1 through 30 467 463 461 457 449 443 439 433 421 419 409 401 397 383 379 373 367 353 349 331 317 313 307 283 281 269 257 251 241 239 Columns 31 through 58 229 223 211 199 197 173 167 163 149 131 127 113 107 101 97 83 79 71 61 59 47 41 37 31 23 19 17 13 t2 = Columns 1 through 30 13 17 19 23 31 37 41 47 59 61 71 79 83 97 101 107 113 127 131 149 163 167 173 197 199 211 223 229 239 241 Columns 31 through 58 251 257 269 281 283 307 313 317 331 349 353 367 373 379 383 397 401 409 419 421 433 439 443 449 457 461 463 467

Assertion failed.