I do not undertand the problem. If you provide the fibonacci sequence, there is nothing to do.
Test | Status | Code Input and Output |
---|---|---|
1 | Fail |
%%
n = 10;
y_correct = [0 1 1 4 9 25 64 169 441 1156];
assert(isequal(fibo_sq(n),y_correct))
Error: Assertion failed.
|
2 | Fail |
%%
n = 1;
y_correct = [0];
assert(isequal(fibo_sq(n),y_correct))
Error: Assertion failed.
|
3 | Fail |
%%
n = 3;
y_correct = [0 1 1];
assert(isequal(fibo_sq(n),y_correct))
Error: Assertion failed.
|
4 | Fail |
%%
n = 4;
y_correct = [0 1 1 4];
assert(isequal(fibo_sq(n),y_correct))
Error: Assertion failed.
|
300 Solvers
Getting the absolute index from a matrix
178 Solvers
Find nearest prime number less than input number
183 Solvers
166 Solvers
120 Solvers