Cody

# Problem 189. Sum all integers from 1 to 2^n

Solution 1582518

Submitted on 13 Jul 2018 by Deepthi Palagati
This solution is locked. To view this solution, you need to provide a solution of the same size or smaller.

### Test Suite

Test Status Code Input and Output
1   Pass
x = 3; y_correct = 36; assert(isequal(sum_int(x),y_correct))

power = 8 y = 36

2   Pass
x = 7; y_correct = 8256; assert(isequal(sum_int(x),y_correct))

power = 128 y = 8256

3   Pass
x = 10; y_correct = 524800; assert(isequal(sum_int(x),y_correct))

power = 1024 y = 524800

4   Pass
x = 11; y_correct = 2098176; assert(isequal(sum_int(x),y_correct))

power = 2048 y = 2098176

5   Pass
x = 14; y_correct = 134225920; assert(isequal(sum_int(x),y_correct))

power = 16384 y = 134225920

6   Pass
x = 17; y_correct = 8590000128; assert(isequal(sum_int(x),y_correct))

power = 131072 y = 8.5900e+09

### Community Treasure Hunt

Find the treasures in MATLAB Central and discover how the community can help you!

Start Hunting!