I know how to solve this question using a very long and tedious method. However, my friend says that he solved it using Multinomial Theorem. I already know the binomial theorem but I wish to know how to solve this question using Multinomial Theorem. Please help!!!

Find the number of words that can be formed taking 6 letters of the word ALLAHABAD at a time.

No vote yet

6 votes

×

Problem Loading...

Note Loading...

Set Loading...

Easy Math Editor

`*italics*`

or`_italics_`

italics`**bold**`

or`__bold__`

boldNote: you must add a full line of space before and after lists for them to show up correctlyparagraph 1

paragraph 2

`[example link](https://brilliant.org)`

`> This is a quote`

Remember to wrap math in \( ... \) or \[ ... \] to ensure proper formatting.`2 \times 3`

`2^{34}`

`a_{i-1}`

`\frac{2}{3}`

`\sqrt{2}`

`\sum_{i=1}^3`

`\sin \theta`

`\boxed{123}`

## Comments

Sort by:

TopNewestit can be solved by using permutations you don't even need using some other theorems

Log in to reply

I already know how to solve it using permutations, but the Multinomial theorem is supposed to make it much shorter.

Log in to reply

The multinomial theorem is a generalization of the binomial theorem. It is proved in a way similar to the binomial theorem, so if you know the proof of the binomial theorem, you should understand the multinomial theorem. You can find further information here and here.

In regards to your problem, we could consider a generating function approach. Consider the expansion of \((A + L + H + B + D)^{6}\). We are looking for the sum of the coefficients of the terms of the form \(A^{a}L^{l}H^{h}B^{b}D^{d}\), where \(a \leq 4\), \(l \leq 2\), and \(h, b, d \leq 1\) (these restrictions come from the number of times each letter appears in ALLAHABAD). We can use the multinomial theorem to find the coefficients of each of these terms. I have not actually worked out this problem, but it seems that this solution still requires a bit of calculation.

Log in to reply

With regards to the generating function approach, the setup indicates that you rather consider the expansion of \( (1+x+x^2+x^3+x^4)(1+x+x^2)(1+x)(1+x)(1+x)\) and calculate the coefficient of \(x^6\).

Using the multinomial theorem greatly over counts, and there is no easy way to remove the over counting. PIE comes to mind, but there are too many cases.

Log in to reply

What I posted wasn't entirely true. As you're allowed to rearrange the terms, you want to look at the exponential generating function instead. In this case, we're interested in the coefficient of \(x^6\) in

\[ 6! (1 + \frac {1}{1!}x + \frac {1}{2!} x^2 + \frac {1}{3!}x^3 + \frac {1}{4!}x^4)(1 + \frac {1}{1!}x + \frac {1}{2!}x^2)(1+\frac {1}{1!} x ) ( 1 + \frac {1}{1!}x) ( 1 + \frac {1}{1!}x) \]

Log in to reply

Do you know the answer? I'm getting 2115. If I'm correct then I can probably guide you.

Log in to reply

The answer is correct. Please tell me how to do it using the generating function approach Calvin and Omid mentioned above. Thanks!

Log in to reply

How much do you understand of generating functions? For example, do you know how to create the generating function that will yield the number of heads in 10 coin tosses?

Log in to reply

Log in to reply

Can you state the Multinomial Theorem, or what you understand of it?

Log in to reply

I didn't understand the Multinomial Theorem at all, since the way my friend explained it was confusing. Please direct me to the right website with some solved example questions so I can understand it better. Also tell me how to solve the question I have posted above. Thank you!

Log in to reply

The multinomial theorem is a pretty direct extension of the binomial theorem. Before I talk about that, let's see if you understand how to apply the binomial theorem first.

Let's say I have 4 A's and 6 L's. How many 5-letter 'words' can I form? How would you solve this using only the Binomial theorem?

Log in to reply

Log in to reply