i + j + k + l = 2 0 1 6 ∑ ( i 5 0 5 ) ( j 5 0 5 ) ( k 5 0 5 ) ( l 5 0 5 ) Find the previous sum over all possible quadruples of non-negative integers i , j , k , and l , where each one of these indexes is less than or equal to 505, and their sum is 2016 as indicated above.
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.
Did the same way.
Log in to reply
my calculator was upto 10 digits so i calculated the last 2 digit.
There are 4 types of objects each having 5 0 5 entities.
We need to select certain number of entities from all the types such that the total number of entities selected is 2 0 1 6 . This is the same as selecting 2 0 1 6 entities out of these 4 × 5 0 5 entities.
⇒ ( 2 0 1 6 2 0 2 0 ) = 6 9 1 , 6 7 7 , 2 7 4 , 3 4 5
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.
Problem Loading...
Note Loading...
Set Loading...
It is easy to see that the given sum is going to be the coefficient of the x 2 0 1 6 in the expansion of the product ( 1 + x ) 5 0 5 ( 1 + x ) 5 0 5 ( 1 + x ) 5 0 5 ( 1 + x ) 5 0 5 . Additionally, ( 1 + x ) 2 0 2 0 has the same expanded form as this product. Therefore the given sum is equal to ( 2 0 1 6 2 0 2 0 ) = 6 9 1 6 7 7 2 7 4 3 4 5 .