Test | Status | Code Input and Output |
---|---|---|
1 | Pass |
n=10;
y_correct = 17;
assert(isequal(sum_prime(n),y_correct))
|
2 | Pass |
n=1;
y_correct = 0;
assert(isequal(sum_prime(n),y_correct))
|
3 | Pass |
n=1000;
y_correct = 76127;
assert(isequal(sum_prime(n),y_correct))
|
4 | Pass |
n=185;
y_correct = 3447;
assert(isequal(sum_prime(n),y_correct))
|
10765 Solvers
434 Solvers
Back to basics 4 - Search Path
280 Solvers
Back to basics 11 - Max Integer
611 Solvers
Compute LOG(1+X) in natural log
169 Solvers