Test | Status | Code Input and Output |
---|---|---|
1 | Pass |
n = 1;
area_correct = 25;
tolerance = 1e-12;
assert(abs(triangle_sequence(n)-area_correct)<tolerance)
|
2 | Pass |
n = 2;
area_correct = 41;
tolerance = 1e-12;
assert(abs(triangle_sequence(n)-area_correct)<tolerance)
|
3 | Pass |
n = 3;
area_correct = 66;
tolerance = 1e-12;
assert(abs(triangle_sequence(n)-area_correct)<tolerance)
|
4 | Pass |
n = 50;
area_correct = 439116598409;
tolerance = 1e-3;
assert(abs(triangle_sequence(n)-area_correct)<tolerance)
|
Project Euler: Problem 5, Smallest multiple
241 Solvers
451 Solvers
Flag largest magnitude swings as they occur
524 Solvers
181 Solvers
2131 Solvers