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 = 6;
y_correct = 1;
assert(isequal(your_fcn_name(x),y_correct))
ans =
logical
1
|
2 | Pass |
x = 5;
y_correct = 0;
assert(isequal(your_fcn_name(x),y_correct))
ans =
logical
0
|
3 | Pass |
x = 28;
y_correct = 1;
assert(isequal(your_fcn_name(x),y_correct))
ans =
logical
1
|
4 | Pass |
x = -37;
y_correct = 0;
assert(isequal(your_fcn_name(x),y_correct))
ans =
logical
0
|
5 | Pass |
x = 496;
y_correct = 1;
assert(isequal(your_fcn_name(x),y_correct))
ans =
logical
1
|
6 | Pass |
x = 500;
y_correct = 0;
assert(isequal(your_fcn_name(x),y_correct))
ans =
logical
0
|
Make the vector [1 2 3 4 5 6 7 8 9 10]
29427 Solvers
2278 Solvers
Find out sum of prime number till given number
92 Solvers
303 Solvers
250 Solvers