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 |
n = 10;
y = 55;
assert(isequal(summation(n),y))
a =
1 2 3 4 5 6 7 8 9 10
|
2 | Pass |
n = 0;
y = 0;
assert(isequal(summation(n),y))
a =
1×0 empty double row vector
|
3 | Pass |
n = 17;
y = 153;
assert(isequal(summation(n),y))
a =
Columns 1 through 16
1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16
Column 17
17
|
Find the two most distant points
1236 Solvers
Find state names that end with the letter A
552 Solvers
Sum all integers from 1 to 2^n
6335 Solvers
905 Solvers
281 Solvers