Test | Status | Code Input and Output |
---|---|---|
1 | Fail |
x = 0;
y_correct = 2;
assert(isequal(nearestprime(x),y_correct))
d =
0
|
2 | Fail |
x = 5;
y_correct = 5;
assert(isequal(nearestprime(x),y_correct))
d =
0
y =
5 5
y =
5 5
|
3 | Pass |
x = 100;
y_correct = 101;
assert(isequal(nearestprime(x),y_correct))
d =
0
y =
99 101
y =
101
|
4 | Pass |
x = 500;
y_correct = 499;
assert(isequal(nearestprime(x),y_correct))
d =
0
y =
499 501
y =
499
|
5 | Fail |
x = 911;
y_correct = 911;
assert(isequal(nearestprime(x),y_correct))
d =
0
y =
911 911
y =
911 911
|
6 | Pass |
x = 2500;
y_correct = 2503;
assert(isequal(nearestprime(x),y_correct))
d =
0
y =
2497 2503
y =
2503
|
7 | Pass |
x = 8000;
y_correct = 7993;
assert(isequal(nearestprime(x),y_correct))
d =
0
y =
7993 8007
y =
7993
|
8 | Pass |
x = 100000;
y_correct = 100003;
assert(isequal(nearestprime(x),y_correct))
d =
0
y =
99997 100003
y =
100003
|
9 | Pass |
x = 1300000;
y_correct = 1299989;
assert(isequal(nearestprime(x),y_correct))
d =
0
y =
1299989 1300011
y =
1299989
|
10 | Pass |
x = 179424710;
y_correct = 179424719;
assert(isequal(nearestprime(x),y_correct))
d =
0
y =
179424701 179424719
y =
179424719
|
Determine if a Given Number is a Triangle Number
286 Solvers
153 Solvers
535 Solvers
315 Solvers
Sums of Multiple Pairs of Triangular Numbers
179 Solvers