Question 1157796: How many distinguishable permutations can be formed from the letters in the word "sassafras"??
Please solve thanks! Found 2 solutions by Shin123, MathTherapy:Answer by Shin123(626) (Show Source):
You can put this solution on YOUR website! Because there are 9 letters, there are 9! ways to do it, right? However, there are 4 s's and 3 a's that we have to account for. There are 4! and 3! ways to arrange the s's and a's, respectively. So there are actually ways to arrange the letters. Simplifying, we get .
You can put this solution on YOUR website!
How many distinguishable permutations can be formed from the letters in the word "sassafras"??
Please solve thanks!
NOTHING to solve here!!! This just needs to be SIMPLIFIED!!
Nine (9) letters, of which there are 4 "ESSES", and 3 "As", so we get:
