Binomial Summations 3

Algebra Level 4

0 i < j n ( n i ) + ( n j ) \displaystyle \Large \sum_{0 \le i < j \le n} \binom{n}{i} + \binom{n}{j}

The sum is taken over all ordered pairs ( i , j ) (i,j) satisfying 0 i < j n 0 \le i < j \le n . If n = 12 n = 12 , find the value of the above sum.


The answer is 49152.

This section requires Javascript.
You are seeing this because something didn't load right. We suggest you, (a) try refreshing the page, (b) enabling javascript if it is disabled on your browser and, finally, (c) loading the non-javascript version of this page . We're sorry about the hassle.

1 solution

Kunal Verma
Dec 1, 2015

Expression is symmetric. Making a 13 × 13 13 \times 13 grid, we list out all the possible ordered pairs of ( i , j ) (i, \ j) . As expression is symmetric, both sides of the diagonal from ( 0 , 0 ) ( \ 0, \ 0 ) to ( 12 , 12 ) (12, \ 12) have equal sum. So we just need to find both side's sum and then half it. This is done by evaluating the non inequality constrained sum and then subtracting the sum of elements forming the diagonals i.e. where i = j i \ = \ j . Doing so and dividing by 2 2 we get 12 × 2 12 = 49152 12 \times \ 2^{12} \ = \boxed{49152}

Same solution, same opinion.

Manuel Kahayon - 4 years, 10 months ago

Could you please elaborate. I didn't got you?

Anurag Pandey - 4 years, 8 months ago

0 pending reports

×

Problem Loading...

Note Loading...

Set Loading...