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 |
assert(isequal(times2(1),2));
|
| 2 | Pass |
assert(isequal(times2(11),22));
|
| 3 | Pass |
assert(isequal(times2(-3),-6));
|
| 4 | Pass |
assert(isequal(times2(29),58));
|
13673 Solvers
Project Euler: Problem 7, Nth prime
281 Solvers
407 Solvers
966 Solvers
204 Solvers