Verify that the equality

x1+....+xr=n,xi0n!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 iof the alphabet a total of xitimes for each i=1,...,r?

Short Answer

Expert verified

It is verified that

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

Step by step solution

01

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

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

and n=3andr=2

x1+x2=n, so the values of x1andx2are

localid="1649230670057" role="math" 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,xi0n!x1!x2!....xr!=rnwe get.

localid="1649230729929" role="math" 3!0!3!+3!1!2!+3!2!1!+3!3!0!=231+3+3+!=88=8

Hence, it is proved thatlocalid="1649229296754" x1+....+xr=n,xi0n!x1!x2!....xr!=rn.

02

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

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

n=3,r=3

Consider, role="math" localid="1649229554269" x1+x2+x3=n, so the values are

role="math" localid="1649230489627" 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,xi0n!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

03

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

The given equality is x1+....+xr=n,xi0n!x1!x2!....xr!=rnand

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 thatx1+....+xr=n,xi0n!x1!x2!....xr!=rn.

Unlock Step-by-Step Solutions & Ace Your Exams!

  • Full Textbook Solutions

    Get detailed explanations and key concepts

  • Unlimited Al creation

    Al flashcards, explanations, exams and more...

  • Ads-free access

    To over 500 millions flashcards

  • Money-back guarantee

    We refund you if you fail your exam.

Over 30 million students worldwide already upgrade their learning with Vaia!

One App. One Place for Learning.

All the tools & learning materials you need for study success - in one app.

Get started for free

Most popular questions from this chapter

Let Hk(n)be the number of vectors x1,...,xkfor which each xiis a positive integer satisfying 1xinand x1x2,,xk.

(a)Without any computations, argue that

localid="1648218400232" H1(n)=nHk(n)=j=1nHk-1(j)k>1

Hint: How many vectors are there in which xk=j?

(b) Use the preceding recursion to compute H3(5).

Hint: First compute H2(n)forn=1,2,3,4,5.

How many different letter arrangements can be made from the letters (a) Fluke? (b) Propose? (c) Mississippi? (d) Arrange?

If 8new teachers are to be divided among 4schools, how many divisions are possible? What if each school must receive 2teachers?

A person has 8friends, of whom 5will be invited to a party.

(a) How many choices are there if 2 of the friends are feuding and will not attend together?

(b) How many choices if 2 of the friends will only attend together?

From a set of npeople, a committee of size jis to be chosen, and from this committee, a subcommittee of size i, ij, is also to be chosen.

(a) Derive a combinatorial identity by computing, in two ways, the number of possible choices of the committee and subcommittee—first by supposing that the committee is chosen first and then the subcommittee is chosen, and second

by supposing that the subcommittee is chosen first and then the remaining members of the committee are chosen.

(b) Use part (a) to prove the following combinatorial identity:role="math" localid="1648189818817" j=innjji=ni2n-i;in

(c) Use part (a) and Theoretical Exercise 13 to show that:role="math" localid="1648189841030" j=innjji-1n-j=0;i<n

See all solutions

Recommended explanations on Math Textbooks

View all explanations

What do you think about this solution?

We value your feedback to improve our textbook solutions.

Study anywhere. Anytime. Across all devices.

Sign-up for free