Test | Status | Code Input and Output |
---|---|---|
1 | Pass |
n = 1;
f_correct = 1;
assert(isequal(fib_decomposition(n),f_correct))
|
2 | Pass |
n = 4;
f_correct = [1 3];
assert(isequal(fib_decomposition(n),f_correct))
|
3 | Pass |
n = 6;
f_correct = [1 5];
assert(isequal(fib_decomposition(n),f_correct))
|
4 | Pass |
n = 2010;
f_correct = [2 34 377 1597];
assert(isequal(fib_decomposition(n),f_correct))
|
5 | Pass |
n = 35601;
f_correct = [1 34 144 6765 28657];
assert(isequal(fib_decomposition(n),f_correct))
|
6 | Pass |
n = 9227467;
f_correct = [2 9227465];
assert(isequal(fib_decomposition(n),f_correct))
|
7 | Pass |
n = 2015;
f_correct = [2 5 34 377 1597];
assert(isequal(fib_decomposition(n),f_correct))
|
325 Solvers
Matrix indexing with two vectors of indices
485 Solvers
Make a vector of prime numbers
194 Solvers
The sum of the numbers in the vector
426 Solvers
198 Solvers
Find the treasures in MATLAB Central and discover how the community can help you!
Start Hunting!