document.write( "Question 842956: How many different words can be formed using all the letters of the word MISSISSIPPI? In how many of these permutations do the four 選痴 not come together?\r
\n" ); document.write( "\n" ); document.write( "What do I do? \n" ); document.write( "

Algebra.Com's Answer #508465 by Edwin McCravy(20056) $\"\"$ $\"About$

You can put this solution on YOUR website!
How many different words can be formed using all the letters of the word MISSISSIPPI?

If they were all distinguishable, the answer would be 11!.\r\n" );
document.write( "But since the 4 I's are indistinguishable we must divide by 4!,\r\n" );
document.write( "and since the 4 S's are indistinguishable we must also divide by 4! again,\r\n" );
document.write( "and since the 2 P's are indistinguishable we must also divide by 2!\r\n" );
document.write( "\r\n" );
document.write( "Answer:  =  =  =

In how many of these permutations do the four 'I's not come together?

We must subtract all the ways the I's come together.\r\n" );
document.write( "\r\n" );
document.write( "That's the distinguishable arrangements of these 8 \"things\"\r\n" );
document.write( "\r\n" );
document.write( "(IIII),M,S,S,S,S,P,P\r\n" );
document.write( "\r\n" );
document.write( "If they were all distinguishable, the answer would be 8!.\r\n" );
document.write( "But since the 4 S's are indistinguishable we must divide by 4!,\r\n" );
document.write( "and since the 2 P's are indistinguishable we must also divide by 2!\r\n" );
document.write( "\r\n" );
document.write( "So we must subtract  =  =  = \r\n" );
document.write( "\r\n" );
document.write( "So we subtract the 840 ways the I's come together from the  and\r\n" );
document.write( "get  \r\n" );
document.write( "\r\n" );
document.write( "Edwin

\n" ); document.write( "

\n" );