This solution is locked. To view this solution, you need to provide a solution of the same size or smaller.
Fibonacii series os that series in which each digit is sum of the previous digits
| Test | Status | Code Input and Output |
|---|---|---|
| 1 | Pass |
%%
n = 1;
f = 1;
assert(isequal(fib(n),f))
f =
1
|
| 2 | Pass |
%%
n = 6;
f = 8;
assert(isequal(fib(n),f))
f =
8
|
| 3 | Pass |
%%
n = 10;
f = 55;
assert(isequal(fib(n),f))
f =
55
|
| 4 | Pass |
%%
n = 20;
f = 6765;
assert(isequal(fib(n),f))
f =
6765
|
5077 Solvers
Which values occur exactly three times?
3115 Solvers
Find the alphabetic word product
1875 Solvers
287 Solvers
442 Solvers