This solution is locked. To view this solution, you need to provide a solution of the same size or smaller.
This is a basic solution, everyone should be able to solve this.
good job yar
| 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));
|
19966 Solvers
Project Euler: Problem 10, Sum of Primes
509 Solvers
Back to basics 17 - white space
201 Solvers
352 Solvers
174 Solvers