Sum of products of binomial coefficients

i + j + k + l = 2016 ( 505 i ) ( 505 j ) ( 505 k ) ( 505 l ) \large\sum_{i+j+k+l=2016} \binom{505}{i}\binom{505}{j}\binom{505}{k}\binom{505}{l} Find the previous sum over all possible quadruples of non-negative integers i , j , k , i,\:j,\:k, and l , l, where each one of these indexes is less than or equal to 505, and their sum is 2016 as indicated above.


The answer is 691677274345.

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.

3 solutions

Arturo Presa
Feb 11, 2016

It is easy to see that the given sum is going to be the coefficient of the x 2016 x^{2016} in the expansion of the product ( 1 + x ) 505 ( 1 + x ) 505 ( 1 + x ) 505 ( 1 + x ) 505 . (1+x)^{505}(1+x)^{505}(1+x)^{505}(1+x)^{505}. Additionally, ( 1 + x ) 2020 (1+x)^{2020} has the same expanded form as this product. Therefore the given sum is equal to ( 2020 2016 ) = 691 677 274 345 . \binom{2020}{2016}=\boxed{691\:677\:274\:345}.

Did the same way.

Archit Agrawal - 5 years, 4 months ago

Log in to reply

my calculator was upto 10 digits so i calculated the last 2 digit.

aryan goyat - 5 years, 4 months ago

Log in to reply

I also did it.

Archit Agrawal - 5 years, 4 months ago
Harsh Khatri
Feb 11, 2016

There are 4 \displaystyle 4 types of objects each having 505 \displaystyle 505 entities.

We need to select certain number of entities from all the types such that the total number of entities selected is 2016 \displaystyle 2016 . This is the same as selecting 2016 \displaystyle 2016 entities out of these 4 × 505 \displaystyle 4 \times 505 entities.

( 2020 2016 ) = 691 , 677 , 274 , 345 \displaystyle \Rightarrow { 2020 \choose 2016} = \boxed{691,677,274,345}

If the sum of upper indices and lowrer indices are constant the the summation converges to the Sum of the upper indices and Sum of lower indices as the Upper and lower indices.

0 pending reports

×

Problem Loading...

Note Loading...

Set Loading...