Q. 1.20
Question
Verify that the equality
when , and then show that it always valid. (The sum is over all vectors of nonnegative integer values whose sum is .)
Hint: How many different n letter sequences can be formed from the first letters of the alphabet? How many of them use letter of the alphabet a total of times for each ?
Step-by-Step Solution
Verified Answer
It is verified that
1Step 1. Verify the given equality for n   =   3 ,   r   =   2 .
The given equality is
and
, so the values of are
Substituting the values in the equality we get.
Hence, it is proved that .
2Step 2. Verify the given equality for n = 3 ,   and   r = 3
The given equality is
Consider, , so the values are
Substituting the values in the equality , we get
3Step 3. Verify the given equality for n = 5 ,   r = 2
The given equality is and
Consider , so the values are
Therefore, it is proved that .
Other exercises in this chapter
Q. 1.18
In a certain community, there are 3 families consisting of a single parent and 1 child, 3 families consisting of a single parent and 2 children, 5 families cons
View solution Q. 1.19
If there are no restrictions on where the digits and letters are placed, how many 8-place license plates consisting of 5 letters and 3 digits are possible if no
View solution Q. 1.17
Give an analytic verification ofn2=k2+k(n-k)+n-k2, 1≤k≤nNow, give a combinatorial argument for this identity.
View solution