# Thread: word question

1. ## word question

how many five letter words can be formed using letters of word MANAGEMENT such that the two alike letters are there then they are always together

2. You can look at the Wikipedia page on the "Multinomial theorem". In the section "Number of unique permutations of words" it shows you the answer

https://secure.wikimedia.org/wikiped...tions_of_words

Tony Bruguier

3. but how will i get the answer

4. They work out the example for the word "MISSISSIPPI". You can adapt from it, however, it might be better to try to understand why the formula is correct. I can help you with this if you have specific questions.

Tony

5. can yu give some hint

6. This problem is more complicated than finding the number of permutations of "MISSISSIPPI": first, one counts five-letter words only; second, similar letters must be together.

7. can yu help me

8. Letters with multiplicities are (M2, A2, N2, G1, E2, T1).

How five letter words with 1M 1A 1N 1G 1E?
How five letter words with 2M's 1A 1N 1G?
How five letter words with 2M's 2A's and 1N?

After knowing this, what is one way to count all the possibilities?