This solution is locked. To view this solution, you need to provide a solution of the same size or smaller.
Test | Status | Code Input and Output |
---|---|---|
1 | Pass |
n = 3;
y_correct = 3;
assert(isequal(closestPrime(n),y_correct))
|
2 | Pass |
n = 20;
y_correct = 23;
assert(isequal(closestPrime(n),y_correct))
|
3 | Pass |
n = 86;
y_correct = 89;
assert(isequal(closestPrime(n),y_correct))
|
4 | Pass |
n = 250;
y_correct = 251;
assert(isequal(closestPrime(n),y_correct))
|
Return the 3n+1 sequence for n
5205 Solvers
Make one big string out of two smaller strings
1070 Solvers
Getting the indices from a vector
1445 Solvers
166 Solvers
Create an index-powered vector
232 Solvers