Respuesta :
We have already chosen "i" to be the first letter. This means that we still have 8 letters that we can use as the second letter. Once that letter is chosen, we still have 7 letters that we can use as the third letter, and so on. This means we have
[tex]8 \times 7 \times 6 \times 5 \times 4 \times 3 \times 2 \times 1 = 8![/tex]
ways of choosing the remaining 8 letters.
However, some of the 8 available letters are equal: we have 2 m's, 2 t's and 2 e's. This means that we overcounted the number of words on the reasoning above. We can correct the counting by dividing three times by 2!, one time for each of the repeated letters.
The final answer is
[tex]\dfrac{8!}{2! \times 2! \times 2!} = \dfrac{40320}{8} = 5040.[/tex]
Using factorials, it is found that 5040 distinct words can be formed.
-------------------
- A word has n letters.
- Consider that there are m repeating letters, each repeating [tex]n_1,n_2,...,n_m[/tex] times
- The number of distinct words that can be formed is given by:
[tex]N = \frac{n!}{n_1!n_2!...n_m!}[/tex]
-------------------
- Committee has 9 letters.
- We want words starting with i, thus, we consider 8 letters, thus [tex]n! = 8[/tex].
- m, t and e repeat twice, and thus, [tex]n_1 = n_2 = n_3 = 2[/tex]
The number of distinct words is given by:
[tex]N = \frac{8!}{2!2!2!} = 5040[/tex]
5040 distinct words can be formed.
A similar problem is given at https://brainly.com/question/16088294