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),
Answer by sudhanshu_kmr(1152)   (Show Source):
You can put this solution on YOUR website!
Here there are 9 letters in which 's' is two times and 'e' is two times.
no. of ways to arrange m letters where some letter are repeated n, r, s,...times
= m!/ [(n!)(r!)(s!)........]
in this question m= 9, n= 2, r = 2
no. of ways = 9!/[2! * 2!] = 90720
here there is arrangement of letters in word, so we will use permutation.
9! is actually arrangement of 9 letters from 9 letters = 9P9 = 9!
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
sudhanshu.cochin@yahoo.com or sudhanshu.cochin@gmail.com
Best of luck.......
|
|
|
