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 = 2;
y_correct = 10;
assert(isequal(your_fcn_name(x),y_correct))
|
2 | Pass |
x = 3;
y_correct = 36;
assert(isequal(your_fcn_name(x),y_correct))
|
3 | Pass |
x = 4;
y_correct = 136;
assert(isequal(your_fcn_name(x),y_correct))
|
4 | Pass |
x = 5;
y_correct = 528;
assert(isequal(your_fcn_name(x),y_correct))
|
5 | Pass |
x = 6;
y_correct = 2080;
assert(isequal(your_fcn_name(x),y_correct))
|
6 | Pass |
x = 7;
y_correct = 8256;
assert(isequal(your_fcn_name(x),y_correct))
|
7 | Pass |
x = 8;
y_correct = 32896;
assert(isequal(your_fcn_name(x),y_correct))
|
8 | Pass |
x = 15;
y_correct = 536887296;
assert(isequal(your_fcn_name(x),y_correct))
|
Return the 3n+1 sequence for n
5207 Solvers
Sum the elements in either diagonal of a square matrix
145 Solvers
348 Solvers
Conversion from hours to mili sec
90 Solvers
Output a vector which is table of 9
102 Solvers