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

Solution 52050

Submitted on 26 Feb 2012 by James Tursa

This solution is locked. To view this solution, you need to provide a solution of the same size or smaller.

Jan on 26 Feb 2012

This solution accepts arrays, avoids the explicite creation of 1:2^n and calculates the expensive power once only.

Test	Status	Code Input and Output
1	Pass	x = 3; y_correct = 36; assert(isequal(sum_int(x),y_correct))
2	Pass	x = 7; y_correct = 8256; assert(isequal(sum_int(x),y_correct))
3	Pass	x = 10; y_correct = 524800; assert(isequal(sum_int(x),y_correct))
4	Pass	x = 11; y_correct = 2098176; assert(isequal(sum_int(x),y_correct))
5	Pass	x = 14; y_correct = 134225920; assert(isequal(sum_int(x),y_correct))
6	Pass	x = 17; y_correct = 8590000128; assert(isequal(sum_int(x),y_correct))