r = 1 ∑ 2 0 1 6 r 3 ( r 2 0 1 6 )
If the value of the summation above is equal to A , find the sum of digits of the number 2 0 1 6 × 2 2 0 1 6 A when it is written in decimal representation.
(This problem is not original)
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.
There is also a nice combinatorial way of interpreting the identity.
Consider a class of 2016 students. Our aim is to select any group of students and then assign 3 different jobs to the group such that one job is allocated to one person only. Note that it is possible that multiple jobs are assigned to the same person. The sum A in the above question represents the obvious way of finding the answer. Another way to solve the counting problem is to first allocate the 3 jobs to the students and then forming a group.
Making 3 cases based on the number of students to which a job is assigned (either 1,2 or 3 students) the answer can be easily obtained as
A = ( 2 0 1 6 ) ( 2 0 1 5 ) ( 2 0 1 4 ) 2 2 0 1 3 + ( 2 0 1 6 ) ( 2 0 1 5 ) ( 3 ) ( 2 2 0 1 4 ) + ( 2 0 1 6 ) 2 2 0 1 5
First of all,a very nice solution.But,in the last term,all three jobs are given to a single student.So,one student can be selected in 2016 ways.The remaining 2015 students have each two choice,they will be present in the group or they will not be present in the group,hence total number of ways is 2016*2^2015.
Log in to reply
Sorry it was a typing mistake . I have corrected it.
We use generating functions to solve this.
Consider F ( x ) = ( 1 + x ) 2 0 1 6 = ( 0 2 0 1 6 ) + ( 1 2 0 1 6 ) x 1 + ⋯ + ( 2 0 1 6 2 0 1 6 ) x 2 0 1 6
It is not hard to see that G ( x ) = d x d [ x ⋅ d x d [ x ⋅ d x d F ( x ) ] ] = ( 1 2 0 1 6 ) ⋅ 1 3 ⋅ x 0 + ( 2 2 0 1 6 ) ⋅ 2 3 ⋅ x 1 + ⋯ + ( 2 0 1 6 2 0 1 6 ) ⋅ 2 0 1 6 3 ⋅ x 2 0 1 5
After a bit of differentiation and algebra, we find G ( x ) = 2 0 1 6 ( 1 + x ) 2 0 1 5 + 2 0 1 6 ⋅ 2 0 1 5 x ( 1 + x ) 2 0 1 4 + 2 0 1 6 ⋅ 2 0 1 5 [ 2 x ( 1 + x ) 2 0 1 4 + 2 0 1 4 x 2 ( 1 + x ) 2 0 1 3 ]
We want the digit sum of 2 0 1 6 ⋅ 2 2 0 1 6 A = 2 0 1 6 ⋅ 2 2 0 1 6 G ( 1 ) = 2 0 1 6 ⋅ 2 2 0 1 6 2 0 1 6 ⋅ 2 2 0 1 4 [ 2 ⋅ 2 0 1 6 + 2 0 1 5 + 2 0 1 5 ⋅ 1 0 0 7 ] = 2 0 1 6 ⋅ 2 2 0 1 6 2 0 1 6 ⋅ 2 2 0 1 6 ⋅ 5 0 8 7 8 8 = 5 0 8 7 8 8 which is just 3 6
Where have u copied this problem from? Plz learn to give credit man..... ;)
Problem Loading...
Note Loading...
Set Loading...