Test | Status | Code Input and Output |
---|---|---|
1 | Pass |
n = 1;
f_correct = 1;
assert(isequal(fib_decomposition(n),f_correct))
f =
1
|
2 | Pass |
n = 4;
f_correct = [1 3];
assert(isequal(fib_decomposition(n),f_correct))
f =
1 3
|
3 | Pass |
n = 6;
f_correct = [1 5];
assert(isequal(fib_decomposition(n),f_correct))
f =
1 5
|
4 | Pass |
n = 2010;
f_correct = [2 34 377 1597];
assert(isequal(fib_decomposition(n),f_correct))
f =
2 34 377 1597
|
5 | Pass |
n = 35601;
f_correct = [1 34 144 6765 28657];
assert(isequal(fib_decomposition(n),f_correct))
f =
1 34 144 6765 28657
|
6 | Pass |
n = 9227467;
f_correct = [2 9227465];
assert(isequal(fib_decomposition(n),f_correct))
f =
2 9227465
|
7 | Pass |
n = 2015;
f_correct = [2 5 34 377 1597];
assert(isequal(fib_decomposition(n),f_correct))
f =
2 5 34 377 1597
|
325 Solvers
464 Solvers
Find the maximum number of decimal places in a set of numbers
739 Solvers
Circular Primes (based on Project Euler, problem 35)
141 Solvers
461 Solvers
Find the treasures in MATLAB Central and discover how the community can help you!
Start Hunting!