Could someone help me understand a book's solution to the following problem? I am providing my own solution, but I fail to understand theirs.
Question:
How many ways are there to arrange the letters in VISITING with no
pair of consecutive Is?
My Solution:
- There are three Is and five other letters. I first arrange the five other letters with a space between each one, in the beginning and in the end. There are $5!$ ways of arranging them: _X_X_X_X_X_
- The previous step creates six empty places in which three Is may be arranged, but only three places must be chosen. Order does not matter, as all three Is are the same.
Thus, there are $\dbinom{6}{3}$ ways of choosing those places.
My Answer: $5!\cdot\dbinom{6}{3}$
Book's Answer: $\dbinom{(5-2)+4-1}{(5-2)}\cdot5!$
Both answers yield the same numeric result of $2400$, but I don't fully understand their answer or rather how they achieved it. I'm sure in fact that the second part, $5!$, is the arrangement of five other letters, other than Is. This leaves the first part of the answer, which is selection with repetitions. I do not know what $(5-2)$ and $4$ parts represent, especially $4$.
Best Answer
A gentleman on ##math freenode IRC channel was kind enough to explain this to me, so here's the solution for anyone wondering:
Solution:
Answer: $\dbinom{3+4−1}{3}\cdot5!$ or $\dbinom{(5-2)+4-1}{(5-2)}\cdot5!$