Number of words that can be made using all the letters of the word W, if Os as well as Is are separated is?

Your mistake is not noticing that the I's can be non-separated two different ways: We can have all three of them together as III, but we can also have II in one place and I in another.

One way to calculate how many ways this can happen is to think of one pair II as a single letter, and the third I as a separate letter, and count the number of words we can make. This will count each III case twice: Once as I II, and once as II I. So we have to subtract the number of such cases once.

With this correction, the final calculation becomes $$ \overbrace{\frac{12!}{3!2!2!}}^{\text{All words}} - \overbrace{\frac{11!}{3!2!}}^{\text{O's not separate}} - \overbrace{\left(\underbrace{\frac{11!}{2!2!}}_{\text{II and I}} - \underbrace{\frac{10!}{2!2!}}_{\text{III}}\right)}^{\text{I's not separate}} + \overbrace{\left(\underbrace{\frac{10!}{2!}}_{\text{OO, II and I}} - \underbrace{\frac{9!}{2!}}_{\text{OO and III}}\right)}^{\text{Neither O's nor I's separate}} $$ which turns out to be $8!\cdot 228$.


The letter $I$ appears three times. You have calculated the number of ways to arrange the letters so that the three copies of $I$ aren't all in the same place (and also the two $O$s are separated). However, "separated" here means that no two of them are together. Your count includes such "words" as STIILOCATINO, which should be excluded.


How did you get each of the terms of $n$?

  • $\frac{12!}{3!2!2!}$ : The number of ways of arranging the letters of SOLICITATION.

  • $\frac{11!}{2!3!}$ : The number of ways in which the two $O$s can be together in SOLICITATION.

  • $\frac{10!}{2!2!}$ : The number of ways in which the three $I$s can be together in SOLICITATION.

  • $\frac{9!2!}{2!}$ : The number of ways in which the three $I$s and two $O$s can be together in SOLICITATION.

Well , the problem is this : the complement of this case, also includes the case where two $I$s can be together and the third can be separate. You have not neglected this case, and that's why you have an answer larger than the given answer.

Tags:

Combinatorics

Combinations

Permutations

Related

Evaluate $\sum_{k=0}^n {{2n + 1}\choose {2k + 1}}$ How can we prove that any integral in the set of non-elementary integrals cannot be expressed in the form of elementary functions? Integer addition + constant, is it a group? Prove that $AC \perp CE$. When is a class function the character of a representation? When to use Iterated Forcing I've worked out the reasoning, but how do I write the proof? How can a function with a hole (removable discontinuity) equal a function with no hole? Finding $\lim\limits_{n\to\infty}\frac1{n^2}\int_0^{\frac{\pi}2}x\left(\frac{\sin nx}{\sin x}\right)^4\,\mathrm dx$ Told by Professor that this is PIE, but don't see how it's PIE. Help understanding what constitutes the sets, or alternative ways to solve? The significance and acceptance of Helfgott’s proof of the weak Goldbach Conjecture Do there exist finite commutative rings with identity that are not Bézout rings?

Recent Posts