Cody

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

Solution 1899145

Submitted on 13 Aug 2019 by Andreas Neul
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))

y = 0 a = 8

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

x = 7; y_correct = 8256; assert(isequal(sum_int(x),y_correct)) y = 0 a = 128

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

x = 10; y_correct = 524800; assert(isequal(sum_int(x),y_correct)) y = 0 a = 1024

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

x = 11; y_correct = 2098176; assert(isequal(sum_int(x),y_correct)) y = 0 a = 2048

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

x = 14; y_correct = 134225920; assert(isequal(sum_int(x),y_correct)) y = 0 a = 16384

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

x = 17; y_correct = 8590000128; assert(isequal(sum_int(x),y_correct)) y = 0 a = 131072