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 = [];
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))
|
7 | Pass |
pn = primes(1e6);
ind = max(100,floor(numel(pn)*rand));
n = pn(ind) - 1;
y_correct = pn(ind - 1);
assert(isequal(minorprime(n),y_correct))
|
The Goldbach Conjecture, Part 2
961 Solvers
Back to basics 22 - Rotate a matrix
682 Solvers
Vectorize the digits of an Integer
236 Solvers
176 Solvers
Switch matrix to a column vector
189 Solvers