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
|
Find the numeric mean of the prime numbers in a matrix.
5905 Solvers
351 Solvers
Back to basics 8 - Matrix Diagonals
707 Solvers
Set some matrix elements to zero
228 Solvers
Rounding off numbers to n decimals
281 Solvers