With my function and R2015B, it works so I don't understand:
function y = isPernicious(x)
%UNTITLED2 Summary of this function goes here
% Detailed explanation goes here
if(x == 1)
y = true;
else
if(mod(x,2) == 0)
y = false;
else
y = true; % PRIME
for k=3:2:x-2
if(mod(x,k) == 0)
y = false; % NOT PRIME
break;
end
end
end
end
end
Test | Status | Code Input and Output |
---|---|---|
1 | Pass |
x = 5;
y_correct = true;
assert(isequal(isPernicious(x),y_correct))
|
2 | Fail |
x = 1;
y_correct = false;
assert(isequal(isPernicious(x),y_correct))
|
3 | Pass |
x = 2^randi(16);
y_correct = false;
assert(isequal(isPernicious(x),y_correct))
|
4 | Pass |
x = 17;
y_correct = true;
assert(isequal(isPernicious(x),y_correct))
|
5 | Fail |
x = 18;
y_correct = true;
assert(isequal(isPernicious(x),y_correct))
|
6 | Pass |
x = 61;
y_correct = true;
assert(isequal(isPernicious(x),y_correct))
|
7 | Fail |
x = 6;
y_correct = true;
assert(isequal(isPernicious(x),y_correct))
|
8 | Pass |
x = 2115;
y_correct = false;
assert(isequal(isPernicious(x),y_correct))
|
9 | Fail |
x = 2114;
y_correct = true;
assert(isequal(isPernicious(x),y_correct))
|
10 | Pass |
x = 2017;
y_correct = true;
assert(isequal(isPernicious(x),y_correct))
|
239 Solvers
469 Solvers
Vectorize the digits of an Integer
236 Solvers
364 Solvers
232 Solvers