This solution is locked. To view this solution, you need to provide a solution of the same size or smaller.
Test | Status | Code Input and Output |
---|---|---|
1 | Pass |
x = [0 1;1 1];
tf = true;
assert(isequal(isFibMat(x),tf))
clear all;
|
2 | Pass |
x = [1 0;1 1];
tf = false;
assert(isequal(isFibMat(x),tf))
clear all;
|
3 | Pass |
x = [0 1;1 1]^40;
tf = true;
assert(isequal(isFibMat(x),tf))
clear all;
|
4 | Pass |
x = [0 1;1 1]^40+1;
tf = false;
assert(isequal(isFibMat(x),tf))
clear all;
|
5 | Pass |
x = [0 1;1 1]^17;
tf = true;
assert(isequal(isFibMat(x),tf))
clear all;
|
6 | Pass |
x = [0 1;1 1]^17-5;
tf = false;
assert(isequal(isFibMat(x),tf))
clear all;
|
7 | Pass |
x = [0 0 1;0 1 1;1 1 1]^3;
tf = false;
assert(isequal(isFibMat(x),tf))
clear all;
tf =
logical
0
|
8 | Pass |
x = [0 0 1;0 1 1];
tf = false;
assert(isequal(isFibMat(x),tf))
clear all;
tf =
logical
0
|
9 | Pass |
x = [[0 1;1 1]^3 [5; 8]];
tf = false;
assert(isequal(isFibMat(x),tf))
clear all;
tf =
logical
0
|
10 | Pass |
x = uint8([0 1; 1 1]^5);
tf = true;
assert(isequal(isFibMat(x),tf))
clear all;
|
11 | Pass |
x = -([0 1; 1 1]^5);
tf = false;
assert(isequal(isFibMat(x),tf))
clear all;
|
12 | Pass |
x = [0 1; 1 1]^5;
x(2) = nan;
tf = false;
assert(isequal(isFibMat(x),tf))
clear all;
|
13 | Pass |
x = [4 7;7 11];
tf = false;
assert(isequal(isFibMat(x),tf))
clear all;
|
14 | Pass |
for ii = 1:55
assert(true==isFibMat([0 1;1 1]^ii))
end
|
2401 Solvers
1800 Solvers
6360 Solvers
Find nearest prime number less than input number
268 Solvers
992 Solvers
Find the treasures in MATLAB Central and discover how the community can help you!
Start Hunting!