This solution is locked. To view this solution, you need to provide a solution of the same size or smaller.
Test | Status | Code Input and Output |
---|---|---|
1 | Pass |
x = 1;
n = 30;
y_correct = 30;
assert(isequal(geometric(x,n),y_correct))
b =
Columns 1 through 29
1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29
Column 30
30
y =
30
|
2 | Pass |
x = 2;
n = 10;
y_correct = 2046;
assert(isequal(geometric(x,n),y_correct))
b =
1 2 3 4 5 6 7 8 9 10
y =
2046
|
3 | Pass |
x = 3;
n = 6;
y_correct = 1092;
assert(isequal(geometric(x,n),y_correct))
b =
1 2 3 4 5 6
y =
1092
|
Sum all integers from 1 to 2^n
6328 Solvers
Number of digits in an integer
271 Solvers
481 Solvers
172 Solvers
36 Solvers