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 = 0;
y_correct = 0;
tolerance = 1e-12;
assert(abs(no_mult_div(n)-y_correct)<tolerance);
y =
0
|
2 | Pass |
n = 0.1;
y_correct = 0.0750;
tolerance = 1e-12;
assert(abs(no_mult_div(n)-y_correct)<tolerance);
y =
0.0750
|
3 | Pass |
n = 1;
y_correct = 0.7500;
tolerance = 1e-12;
assert(abs(no_mult_div(n)-y_correct)<tolerance);
y =
0.7500
|
4 | Pass |
n = -1;
y_correct = -0.7500;
tolerance = 1e-12;
assert(abs(no_mult_div(n)-y_correct)<tolerance);
y =
-0.7500
|
Project Euler: Problem 10, Sum of Primes
707 Solvers
308 Solvers
546 Solvers
365 Solvers
Find the area of the four walls
202 Solvers
Find the treasures in MATLAB Central and discover how the community can help you!
Start Hunting!