Test | Status | Code Input and Output |
---|---|---|
1 | Pass |
p = 233;
y_correct = true;
assert(isequal(your_fcn_name(p),y_correct))
tf =
1
|
2 | Pass |
p = 23;
y_correct14 = true;
assert(isequal(your_fcn_name(p),y_correct14))
tf =
1
|
3 | Pass |
p = 22;
y_correct14 = false;
assert(isequal(your_fcn_name(p),y_correct14))
|
4 | Pass |
p = 1 % p must also be a prime number !!
y_correct1t = false;
assert(isequal(your_fcn_name(p),y_correct1t))
p =
1
|
5 | Pass |
p = 14 % p must also be a prime number !!
correct1t = false;
assert(isequal(your_fcn_name(p),correct1t))
p =
14
|
6 | Pass |
p = 29
correct1tp = true;
assert(isequal(your_fcn_name(p),correct1tp))
p =
29
tf =
1
|
Find all elements less than 0 or greater than 10 and replace them with NaN
11614 Solvers
687 Solvers
Magic is simple (for beginners)
1110 Solvers
Output any real number that is neither positive nor negative
250 Solvers
1490 Solvers