Test | Status | Code Input and Output |
---|---|---|
1 | Pass |
n = 0;
A_correct = 1;
assert(abs(fractal_circles(n)-A_correct)<0.0001);
|
2 | Pass |
n = 1;
A_correct = 8/9;
assert(abs(fractal_circles(n)-A_correct)<0.0001);
|
3 | Pass |
n = 2;
A_correct = 68/81;
assert(abs(fractal_circles(n)-A_correct)<0.0001);
|
4 | Pass |
n = 3;
A_correct = 67/81;
assert(abs(fractal_circles(n)-A_correct)<0.0001);
|
5 | Pass |
n = 4;
A_correct = 5411/6561;
assert(abs(fractal_circles(n)-A_correct)<0.0001);
|
6 | Pass |
n = 5;
A_correct = 48674/59049;
assert(abs(fractal_circles(n)-A_correct)<0.0001);
|
Find all elements less than 0 or greater than 10 and replace them with NaN
11620 Solvers
Create a cell array out of a struct
189 Solvers
Back to basics 21 - Matrix replicating
904 Solvers
214 Solvers
How long is the longest prime diagonal?
280 Solvers