This solution is locked. To view this solution, you need to provide a solution of the same size or smaller.
Seems to me that the "best" answer would be tf = logical(mod(n,2)). But I guess the description does not explicitly require logicals, so maybe I am reading too much into the problem. Using logical makes the solution 17 compared to 13 without.
by calling logical function you add extra code.
| Test | Status | Code Input and Output |
|---|---|---|
| 1 | Pass |
%%
n = 1;
ans_correct = true;
assert(isequal(is_it_odd(n),ans_correct))
|
| 2 | Pass |
%%
n = 2;
ans_correct = false;
assert(isequal(is_it_odd(n),ans_correct))
|
| 3 | Pass |
%%
n = 28;
ans_correct = false;
assert(isequal(is_it_odd(n),ans_correct))
|
| 4 | Pass |
%%
n = 453;
ans_correct = true;
assert(isequal(is_it_odd(n),ans_correct))
|
| 5 | Pass |
%%
n = 17;
ans_correct = true;
assert(isequal(is_it_odd(n),ans_correct))
|
| 6 | Pass |
%%
n = 16;
ans_correct = false;
assert(isequal(is_it_odd(n),ans_correct))
|
Make the vector [1 2 3 4 5 6 7 8 9 10]
27446 Solvers
Sort a list of complex numbers based on far they are from the origin.
3645 Solvers
291 Solvers
319 Solvers
The Answer to Life, the Universe, and Everything
304 Solvers