document.write( "Question 252674: how many five letter words can be made from the letters of the word MANAGEMENT such that if any two alike letters are there then they are always together??? \n" ); document.write( "

Algebra.Com's Answer #184695 by palanisamy(496) $\"\"$ $\"About$

You can put this solution on YOUR website!
The given word is MANAGEMENT
\n" ); document.write( "M twice, N twice, A twice, E twice G once and T once occur in this word.
\n" ); document.write( "We have to keep any two alike letters always together
\n" ); document.write( " Consider the two M's as a single item,two N's as a single item,
\n" ); document.write( "two A's as a single item,two E's as a single item,G as ta single item and T as a single item. Then there are 6 different items.
\n" ); document.write( "They can be arranged in 6! ways.
\n" ); document.write( "Therefore total no of words formed with all the letters = 6! = 720
\n" ); document.write( "
\n" ); document.write( "
\n" ); document.write( " \n" ); document.write( "

\n" );