Test | Status | Code Input and Output |
---|---|---|
1 | Pass |
b = 1;
c = 2;
a_correct = sqrt(3);
tolerance = 1e-12;
assert(abs(calculate_short_side(b,c)-a_correct)<tolerance);
|
2 | Pass |
b = 4;
c = 5;
a_correct = 3;
tolerance = 1e-12;
assert(abs(calculate_short_side(b,c)-a_correct)<tolerance);
|
3 | Pass |
b = 12;
c = 13;
a_correct = 5;
tolerance = 1e-12;
assert(abs(calculate_short_side(b,c)-a_correct)<tolerance);
|
4 | Pass |
b = 8;
c = 10;
a_correct = 6;
tolerance = 1e-12;
assert(abs(calculate_short_side(b,c)-a_correct)<tolerance);
|
Return the 3n+1 sequence for n
6167 Solvers
Project Euler: Problem 3, Largest prime factor
379 Solvers
489 Solvers
326 Solvers
1159 Solvers
Find the treasures in MATLAB Central and discover how the community can help you!
Start Hunting!