This solution is outdated. To rescore this solution, sign in.
IMHO 1 is not a prime, so that on input n=2 the correct answer should be [] and not 1.
Test | Status | Code Input and Output |
---|---|---|
1 | Pass |
n = 127;
y_correct = 113;
assert(isequal(minorprime(n),y_correct))
|
2 | Pass |
n = 125;
y_correct = 113;
assert(isequal(minorprime(n),y_correct))
|
3 | Pass |
n = 3;
y_correct = 2;
assert(isequal(minorprime(n),y_correct))
|
4 | Fail |
n = 2;
y_correct = 1;
assert(isequal(minorprime(n),y_correct))
|
5 | Pass |
n = 1328;
y_correct = 1327;
assert(isequal(minorprime(n),y_correct))
|
6 | Pass |
n = 5050109;
y_correct = 5050099;
assert(isequal(minorprime(n),y_correct))
|
Back to basics 18 - justification
150 Solvers
480 Solvers
367 Solvers
1781 Solvers
Flip the vector from right to left
757 Solvers