Q. 1.20

Question

Verify that the equality

x1+....+xr=n, xi0 n!x1!x2!....xr!=rn


when n = 3, r = 2, and then show that it always valid. (The sum is over all vectors of r nonnegative integer values whose sum is n.)

Hint: How many different n letter sequences can be formed from the first r letters of the alphabet? How many of them use letter i of the alphabet a total of xi times for each i = 1, . . . , r?

Step-by-Step Solution

Verified
Answer

It is verified that

x1+....+xr=n, xi0 n!x1!x2!....xr!=rn

1Step 1. Verify the given equality for n   =   3 ,   r   =   2 .

The given equality is x1+....+xr=n, xi0 n!x1!x2!....xr!=rn

and n=3 and r=2


x1+x2=n, so the values of x1 and x2 are

x1=0, x2=3, x1=1, x2=2, x1=2, x2=1, x1=3, x2=0


Substituting the values in the equality x1+....+xr=n, xi0 n!x1!x2!....xr!=rn we get.


3!0!3!+3!1!2!+3!2!1!+3!3!0!=231+3+3+!=88=8


Hence, it is proved that x1+....+xr=n, xi0 n!x1!x2!....xr!=rn.



2Step 2. Verify the given equality for n = 3 ,   and   r = 3

The given equality is x1+....+xr=n, xi0 n!x1!x2!....xr!=rn

n=3, r=3


Consider, x1+x2+x3=n, so the values are

x1=0, x2=1,  x3=2, x1=1, x2=2,   x3=0, x1=2, x2=1,  x3=0, x1=3, x2=0,  x3=0,x1=0, x2=2,  x3=1, x1=0, x2=3,  x3=0, x1=0, x2=1,  x3=2, x1=0, x2=0,  x3=3, x1=1, x2=0,  x3=2, x1=2, x2=0,  x3=1


Substituting the values in the equality x1+....+xr=n, xi0 n!x1!x2!....xr!=rn, we get


3!0!1!2!+3!1!2!0!+3!2!1!0!+3!3!0!0!+3!0!2!1!+3!0!3!0!+3!0!1!2!+3!0!0!3!+3!1!0!2!+3!2!0!1!=3327=27

3Step 3. Verify the given equality for n = 5 ,   r = 2

The given equality is x1+....+xr=n, xi0 n!x1!x2!....xr!=rn and

n=5, r=2


Consider x1+x2=n, so the values are

x1=0, x2=5, x1=1, x2=4, x1=2, x2=3, x1=3, x2=2, x1=4, x2=1, x1=5, x2=0


5!0!5!+5!1!4!+5!2!3!+5!3!2!+5!4!1!+5!5!0!=2532=32


Therefore, it is proved that x1+....+xr=n, xi0 n!x1!x2!....xr!=rn.