Test | Status | Code Input and Output |
---|---|---|
1 | Fail |
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 | Fail |
n = 3;
y_correct = 2;
assert(isequal(minorprime(n),y_correct))
|
4 | Pass |
n = 2;
y_correct = [];
assert(isequal(minorprime(n),y_correct))
|
5 | Pass |
n = 1328;
y_correct = 1327;
assert(isequal(minorprime(n),y_correct))
|
6 | Fail |
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))
|
Project Euler: Problem 7, Nth prime
339 Solvers
Convert a numerical matrix into a cell array of strings
152 Solvers
119 Solvers
191 Solvers
205 Solvers