( 0 2 0 1 6 ) + ( 1 2 0 1 6 ) + ⋯ + ( 2 0 1 6 2 0 1 6 ) ( 0 2 0 1 6 ) + 2 ( 1 2 0 1 6 ) + ⋯ + 2 2 0 1 6 ( 2 0 1 6 2 0 1 6 )
If the above expression is in the form A 2 0 1 6 , find A .
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.
Problem Loading...
Note Loading...
Set Loading...
We have The Binomial Theorem as ( a + b ) n = n = 0 ∑ 2 0 1 6 ( k n ) a n − k b k , And similarly when a = 1 : ( 1 + b ) n = n = 0 ∑ 2 0 1 6 ( k n ) b k . We use it to investigate the required expression as follows: ( 0 2 0 1 6 ) + ( 1 2 0 1 6 ) + … ( 2 0 1 6 2 0 1 6 ) ( 0 2 0 1 6 ) + 2 ( 1 2 0 1 6 ) + … + 2 2 0 1 6 ( 2 0 1 6 2 0 1 6 ) = = = n = 0 ∑ 2 0 1 6 ( k 2 0 1 6 ) n = 0 ∑ 2 0 1 6 2 k ( k 2 0 1 6 ) = 2 2 0 1 6 3 2 0 1 6 ( 2 3 ) 2 0 1 6 ( 1 + 1 ) 2 0 1 6 ( 1 + 2 ) 2 0 1 6 Therefore the answer is [ ( 2 3 ) 2 0 1 6 ] 2 0 1 6 1 = 2 3 .