Warning: foreach() argument must be of type array|object, bool given in /var/www/html/web/app/themes/studypress-core-theme/template-parts/header/mobile-offcanvas.php on line 20

Prove the multinomial theorem.

Short Answer

Expert verified

It is proved that

x1+x2+x3+......+xrn=(n1,n2,....,nr):n1+n2+...+nr=nnn1,n2,nrx1n1,x2n2,...,xrnr

Step by step solution

01

Step 1. State the Multinomial Theorem.

The Multinomial Theorem is

x1+x2+x3+......+xrn=(n1,n2,....,nr):n1+n2+...+nr=nnn1,n2,nrx1n1,x2n2,...,xrnr

02

Step 2. Prove the theorem.

We have to prove that

x1+x2+x3+......+xrn=(n1,n2,....,nr):n1+n2+...+nr=nnn1,n2,nrx1n1,x2n2,...,xrnr

Let us expand the L.H.S

x1+x2+x3+......+xrn=x1+x2+x3+......+xr×x1+x2+x3+......+xr×...ntimes

There will be many terms formed in the final expansion. Terms are formed by

selecting one variable in eachx1+x2+x3+......+xr

Thus out of n products ofx1+x2+x3+......+xr

x1canbeselectedforn1timesx2canbeselectedforn2times...xrcanbeselectedfornrtimes

Such thatn=n1+n2+....+nr

To select these, it is equivalent to separating ninto groups of n1,n2,....,nr.

This distribution can be done inn!n1!n2!......nr!ways

But this is just one term such that

x1appears n1times

x2appears n2times

and so on.

So, the final term isnn1,n2,nrx1n1,x2n2,...,xrnr

The other terms would be having different n1,n2,....,nrand hence the product is a summation of all such terms like (1), where n=n1+n2+....+nr

Therefore,x1+x2+x3+......+xrn=(n1,n2,....,nr):n1+n2+...+nr=nnn1,n2,nrx1n1,x2n2,...,xrnr

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

We have\(20,000that must be invested among 4possible opportunities. Each investment must be integral in units\)1000,and there are minimal investments that need to be made if one is to invest in these opportunities. The minimal investments are \(2000,\)2000,\(3000,and\)4000. How many different investment strategies are available if

(a)an investment must be made in each opportunity?

(b)investments must be made in at least 3of the 4opportunities?

A president, treasurer, and secretary, all different, are to be chosen from a club consisting of 10 people. How many different choices of officers are possible if

(a) there are no restrictions?

(b) A and B will not serve together?

(c) C and D will serve together or not at all?

(d) E must be an officer?

(e) F will serve only if he is president?

How many 5-digit numbers can be formed from the integers 1,2,...,9if no digit can appear more than twice? (For instance, 41434is not allowed.)

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

Give an analytic verification of

n2=k2+k(n-k)+n-k2,1kn

Now, give a combinatorial argument for this identity.

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