Test | Status | Code Input and Output |
---|---|---|
1 | Pass |
%%
n = 6;
c_correct = 1;
assert(isequal(goldbach2(n),c_correct))
ans =
1
|
2 | Pass |
%%
n = 10;
c_correct = 2;
assert(isequal(goldbach2(n),c_correct))
ans =
2
|
3 | Pass |
%%
n = 50;
c_correct = 4;
assert(isequal(goldbach2(n),c_correct))
ans =
4
|
4 | Pass |
%%
n = 480;
c_correct = 29;
assert(isequal(goldbach2(n),c_correct))
ans =
29
|
3238 Solvers
188 Solvers
Project Euler: Problem 10, Sum of Primes
707 Solvers
Relative ratio of "1" in binary number
392 Solvers
376 Solvers
Find the treasures in MATLAB Central and discover how the community can help you!
Start Hunting!