- Thread starter
- #1

- Thread starter jacks
- Start date

- Thread starter
- #1

- Admin
- #2

- Jan 26, 2012

- 4,055

I am not 100% sure that I am right here but want to give it a shot.How many permutation of the letters of the words $\bf{"MADHUBANI"}$ do not begin with $\bf{M}$ but end with $\bf{I}$

The starting word has 9 letter with two A's. The number of choices for the first letter is 7 though, because I must be used at the end and M cannot be first, so 9-2=7 choices are left. Now write the number of possible letter choices for the second letter. Again it can't be I but this time it could be M, and we must note that a some letter (not I or M) has been chosen for the first spot. 9-1-1=7 again. Try to continue this process until the end of the word.

Lastly, there are two letters A which are identical so when they switch positions but everything else remains the same, the word is the same and we can't double count. To correct for this error you divide the answer you got above by 2!.

- Jan 26, 2012

- 890

If all the letters were different there would be \(8!\) permutations which end with I, of which \(7!\) start with M, so \(8!-7!=7.7!\) would not start with M but end with I. However there is a repeated A so the final answer is half that.How many permutation of the letters of the words $\bf{"MADHUBANI"}$ do not begin with $\bf{M}$ but end with $\bf{I}$

CB

I'll give it a try . . .

How many permutation of the letters of the words $\bf{"MADHUBANI"}$

do not begin with $\bf{M}$ but end with $\bf{I}$

We have the letters: .$ A,A,B,D,H,I,M,N,U.$

We want: .$\_\,\_\,\_\,\_\,\_\,\_\,\_\,\_\,I $

[COLOR=#be00e]n . . . . . . .[/COLOR]$\uparrow$

. . . . . . $\sim\!M$

[1] The first letter is $A\!:\;A\,\_\,\_\,\_\,\_\,\_\,\_\,\_\,I $

. . .The remaining spaces can be filled in $7!$ ways.

[2] The first letter is not $A$ and not $M\!:$

. . . $\_\,\_\,\_\,\_\,\_\,\_\,\_\,\_\,I$

There are 6 choices for the first letter.

. . . The remaining spaces can be filled in $\frac{7!}{2!}$ ways.

Therefore, there are: .$7! + 6\left(\frac{7!}{2!}\right) \:=\:20,160$ ways.

- Admin
- #5

- Jan 26, 2012

- 4,055

Don't we need to divide [1] by 2! as well since we consider the cases when the A 's are switched to be the same?

[1] The first letter is $A\!:\;A\,\_\,\_\,\_\,\_\,\_\,\_\,\_\,I $

. . .The remaining spaces can be filled in $7!$ ways.

Therefore, there are: .$7! + 6\left(\frac{7!}{2!}\right) \:=\:20,160$ ways.

If so, then you'd have \(\displaystyle \frac{7!}{2!}+6\left(\frac{7!}{2!}\right)\) that is \(\displaystyle \left( \frac{7 \cdot 7!}{2!} \right)\) which what CB and I got.

Would like confirmation on this

Last edited:

- Moderator
- #6

- Feb 7, 2012

- 2,799

Both methods are correct, but there is an error in soroban's computation.Don't we need to divide [1] by 2! as well since we consider the cases when the A 's are switched to be the same?

If so, then you'd have \(\displaystyle \frac{7!}{2!}+6\left(\frac{7!}{2!}\right)\) that is \(\displaystyle \left( \frac{7 \cdot 7!}{2!} \right)\) which what CB and I got.

Would like confirmation on this

That red 6 should be a 5: if the first letter is not I, M or[2] The first letter is not $A$ and not $M\!:$

. . . $\_\,\_\,\_\,\_\,\_\,\_\,\_\,\_\,I$

There are 6 choices for the first letter.

. . . The remaining spaces can be filled in $\frac{7!}{2!}$ ways.