document.write( "Question 894461: In how many ways we can arrange the letters in the word 'MISSISIPI' so that all S's come together and 2 I's come together . the spelling of the word has been given like missisipi \n" ); document.write( "
Algebra.Com's Answer #542073 by Theo(13342)![]() ![]() You can put this solution on YOUR website! your original string of letters is missisipi. \n" ); document.write( "rearrange the terms so all the occurrences of s are together and all the occurrences of i are together. \n" ); document.write( "you will get miiiisssp. \n" ); document.write( "replace every 3 occcurrences of s with s and replace every 2 occurrences of i with i. \n" ); document.write( "you will get miisp \n" ); document.write( "the number of possible arrangements of miisp will be equal to 5! / 2! = (5*4*3*2*1) / (2*1) which becomes 5*4*3 which becomes 60. \n" ); document.write( "the number of possible arrangements of miisp will be equal to 60. \n" ); document.write( "that should beyour answer. \n" ); document.write( "there are 60 possible arrangements.\r \n" ); document.write( " \n" ); document.write( "\n" ); document.write( "there are too many to go through to confirm, but we can use a simpler example to see if the formula is correct.\r \n" ); document.write( "\n" ); document.write( "start with missisipi \n" ); document.write( "let's drop an s and drop a p. \n" ); document.write( "we are left with missiii \n" ); document.write( "we want to group all occurrences of s into one s and every pair of occurrences of i into one i. \n" ); document.write( "after we do that, we get: \n" ); document.write( "miis \n" ); document.write( "this is 4 characters and the number of possible arrangements will be 4! / 2! which is equal to 4*3 = 12 \n" ); document.write( "this is a little bit more manageable so lets see what we get.\r \n" ); document.write( " \n" ); document.write( "\n" ); document.write( "the 12 possible arrangements are:\r \n" ); document.write( " \n" ); document.write( "\n" ); document.write( "iims \n" ); document.write( "iism \n" ); document.write( "imis \n" ); document.write( "imsi \n" ); document.write( "isim \n" ); document.write( "ismi \n" ); document.write( "miis \n" ); document.write( "misi \n" ); document.write( "msii \n" ); document.write( "siim \n" ); document.write( "simi \n" ); document.write( "smii\r \n" ); document.write( " \n" ); document.write( "\n" ); document.write( "now we need to expand to see what we get:\r \n" ); document.write( " \n" ); document.write( "\n" ); document.write( "we will replace every occurrence of s with ss and every occurrence of i with ii\r \n" ); document.write( " \n" ); document.write( "\n" ); document.write( "we get:\r \n" ); document.write( " \n" ); document.write( "\n" ); document.write( "iiiimss \n" ); document.write( "iiiissm \n" ); document.write( "iimiiss \n" ); document.write( "iimssii \n" ); document.write( "iissiim \n" ); document.write( "iissmii \n" ); document.write( "miiiiss \n" ); document.write( "miissii \n" ); document.write( "mssiiii \n" ); document.write( "ssiiiim \n" ); document.write( "ssiimii \n" ); document.write( "ssmiiii\r \n" ); document.write( " \n" ); document.write( "\n" ); document.write( "every pair of occurrences of i are together and all occurrences of s are together so we have achieved what we want to achieve.\r \n" ); document.write( " \n" ); document.write( "\n" ); document.write( "this confirms the formula is good and we can be reasonably confident it is correct when we apply it to the larger problem as we did on top.\r \n" ); document.write( " \n" ); document.write( " \n" ); document.write( " \n" ); document.write( " \n" ); document.write( "\n" ); document.write( " \n" ); document.write( " |