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;
y_correct = 3;
assert(isequal(your_fcn_name(x),y_correct))
|
Sum all integers from 1 to 2^n
8414 Solvers
Project Euler: Problem 7, Nth prime
521 Solvers
965 Solvers
314 Solvers
175 Solvers
Find the treasures in MATLAB Central and discover how the community can help you!
Start Hunting!