This solution is outdated. To rescore this solution, sign in.
Please check your test suites, results must have opposite signs.
Thanks! The problem now is reformulated;)
Test | Status | Code Input and Output |
---|---|---|
1 | Pass |
%%
n = 1;
s_correct = 1;
assert(isequal(sumOfSeriesIV(n),s_correct))
|
2 | Pass |
%%
n = 2;
s_correct = -8;
assert(isequal(sumOfSeriesIV(n),s_correct))
|
3 | Pass |
%%
n = 3;
s_correct = 17;
assert(isequal(sumOfSeriesIV(n),s_correct))
|
4 | Pass |
%%
n = 4;
s_correct = -32;
assert(isequal(sumOfSeriesIV(n),s_correct))
|
Find nearest prime number less than input number
183 Solvers
343 Solvers
Convert given decimal number to binary number.
160 Solvers
184 Solvers
Matrix of almost all zeros, except for main diagonal
124 Solvers