Double Sum

Level pending

Find the sum: i = 0 100 j = 0 100 ( 100 i ) ( 100 j ) ( 200 i + j ) \sum_{i=0}^{100}\sum_{j=0}^{100}\frac{{100 \choose i}{100 \choose j}}{{200 \choose i+j}}


The answer is 201.

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

George G
Dec 20, 2013

This Problem is inspired by the "Point Path Probability" https://brilliant.org/mathematics-problem/point-path-probability

Let's show i = 0 n j = 0 n ( n i ) ( n j ) ( 2 n i + j ) = 2 n + 1 \sum_{i=0}^{n}\sum_{j=0}^{n}\frac{{n \choose i} {n \choose j}}{{2n \choose i+j}} = 2n+1 Rearranging, we have: i = 0 n j = 0 n ( n i ) ( n j ) ( 2 n i + j ) = k = 0 2 n 1 ( 2 n k ) i + j = k ( n i ) ( n j ) = k = 0 2 n 1 ( 2 n k ) ( 2 n k ) = 2 n + 1 \sum_{i=0}^{n}\sum_{j=0}^{n}\frac{{n \choose i} {n \choose j}}{{2n \choose i+j}} = \sum_{k=0}^{2n}\frac{1}{{2n \choose k}}\sum_{i+j=k}{n \choose i} {n \choose j} = \sum_{k=0}^{2n}\frac{1}{{2n \choose k}}{2n \choose k} = 2n+1 Where we applied Vandermonde's Identity above.

The second method is using double counting the pairs (s,p) where the point s is on the path p in the "Point Path Probability" problem: i = 0 n j = 0 n ( i + j i ) ( 2 n ( i + j ) n i ) = ( 2 n + 1 ) ( 2 n n ) \sum_{i=0}^{n}\sum_{j=0}^{n}{i+j \choose i} {2n-(i+j) \choose n-i} = (2n+1){2n\choose n} This is equivalent to the first identity by a simple algebraic manipulation.

Let n = 100 n=100 , the answer to the problem is 201 201 .

0 pending reports

×

Problem Loading...

Note Loading...

Set Loading...