Test | Status | Code Input and Output |
---|---|---|
1 | Pass |
%%
x = 1;
y_correct = sqrt(5)/2;
tolerance = 1e-12;
assert(abs(rhombus_side(x)-y_correct)<tolerance)
|
2 | Pass |
%%
x = 3;
y_correct = 5/2;
tolerance = 1e-12;
assert(abs(rhombus_side(x)-y_correct)<tolerance)
|
3 | Pass |
%%
x = 2;
y_correct = sqrt(13)/2;
tolerance = 1e-12;
assert(abs(rhombus_side(x)-y_correct)<tolerance)
|
Find the numeric mean of the prime numbers in a matrix.
5908 Solvers
Do Fast Fourier Transformation
178 Solvers
367 Solvers
254 Solvers
167 Solvers