Test | Status | Code Input and Output |
---|---|---|
1 | Pass |
n = 1;
area_correct = 25;
tolerance = 1e-12;
assert(abs(triangle_sequence(n)-area_correct)<tolerance)
area =
25
|
2 | Pass |
n = 2;
area_correct = 41;
tolerance = 1e-12;
assert(abs(triangle_sequence(n)-area_correct)<tolerance)
area =
41
|
3 | Pass |
n = 3;
area_correct = 66;
tolerance = 1e-12;
assert(abs(triangle_sequence(n)-area_correct)<tolerance)
area =
66
|
4 | Pass |
n = 50;
area_correct = 439116598409;
tolerance = 1e-3;
assert(abs(triangle_sequence(n)-area_correct)<tolerance)
area =
4.3912e+11
|
Find the numeric mean of the prime numbers in a matrix.
5905 Solvers
Project Euler: Problem 3, Largest prime factor
167 Solvers
323 Solvers
2127 Solvers
236 Solvers