document.write( "Question 357275: How many distinguishable words can be formed from the letters of the word \"casserole\" if each letter is used exactly once? If I told you the answer is 90,720; explain in your own words using complete sentences which formula you used and why (Permutations or Combinations), \n" ); document.write( "
Algebra.Com's Answer #255148 by sudhanshu_kmr(1152)![]() ![]() You can put this solution on YOUR website! \r \n" ); document.write( "\n" ); document.write( "Here there are 9 letters in which 's' is two times and 'e' is two times.\r \n" ); document.write( " \n" ); document.write( "\n" ); document.write( "no. of ways to arrange m letters where some letter are repeated n, r, s,...times\r \n" ); document.write( "\n" ); document.write( "= m!/ [(n!)(r!)(s!)........]\r \n" ); document.write( " \n" ); document.write( "\n" ); document.write( "in this question m= 9, n= 2, r = 2\r \n" ); document.write( " \n" ); document.write( "\n" ); document.write( "no. of ways = 9!/[2! * 2!] = 90720\r \n" ); document.write( " \n" ); document.write( "\n" ); document.write( "here there is arrangement of letters in word, so we will use permutation.\r \n" ); document.write( "\n" ); document.write( "9! is actually arrangement of 9 letters from 9 letters = 9P9 = 9!\r \n" ); document.write( " \n" ); document.write( " \n" ); document.write( " \n" ); document.write( " \n" ); document.write( " \n" ); document.write( "\n" ); document.write( "Sometimes there may be typing mistake in solution of a problem, so please ignore it. Understand the concept and try to solve the problem yourself. If there is problem related to concept, contact at \n" ); document.write( "sudhanshu.cochin@yahoo.com or sudhanshu.cochin@gmail.com \n" ); document.write( "Best of luck....... \n" ); document.write( " |