You can
put this solution on YOUR website!The number of letters is 10. But 3 sets show up twice.
If there are n objects with n1 duplicates of one kind, n2 duplicates of a second kind, ..., nk duplicates of a kth kind, then the number of distinguishable permutations of these n objects is
n!/(n1!n2!...nk!)
see --> http://www.ltcconline.net/greenl/Courses/103B/seqSeries/FACTORI.HTM
We get
You can
put this solution on YOUR website!How many distinguishable permutations of letters are possible in the word BASEBALL?
The answer is supposed to be 5040.
----------------------------------
Ans = 8!/(2!*2!*2!)= 8!/8 = 7! = 5040
=========================================
Cheers,
Stan H.