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

Solution 917043

Submitted on 30 Jun 2016 by John D'Errico

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

This solution is outdated. To rescore this solution, sign in.

John D'Errico on 30 Jun 2016

Of course, this solution use the formula from Carl Friedrich Gauss for the sum of the integers from 0 to n.

Test	Status	Code Input and Output
1	Pass	x = 7; y_correct = 8256; assert(isequal(sum_int(x),y_correct))
2	Pass	x = 10; y_correct = 524800; assert(isequal(sum_int(x),y_correct))

Test

Status

Code Input and Output

Pass

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

Pass

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

Select a Web Site