Find the number of different arrangements that are possible for the letters. REMEMBERED
@ujhk77
thought you could explain since you explained the other one nicely, this has repetitions in the letters though
@zordoloom
Have you heard of the function "!"
factorial, i know what it is, though there are repeating letters
Yep
Okay, this one is a little tougher. More to come and sorry for being late.
REMEMBERED in this word there are 2 r's 4 e's 2 m's 1 b and 1 d
okay
So, There are a total of 10 letters, so 10!/(2!*4!*2!)
3628800/96
Which is about 37800 different ways. Someone correct me if i'm wrong.
The total number of letters in the word "remembered" is 9. Therefore, the TOTAL number of combinations is 10!. However, not all of the combinations are UNIQUE (some of them may be the same because some of the numbers are the same). Therefore, we have to filter out the non-unique combinations. Let's do this by figuring out which numbers repeat: We have 4 e's that sometimes repeat. We have 2 m's and 2 r's that also do so. We can plug these into a handy-dandy formula for this sort of stuff: (total # of permutations)!/((#of non-unique elements)!*(number of different non-unique elements)!....) = number of unique permutations. so, we'll plug our numbers in: 10!/(4!*2!*2!) As you can see, 10! is our total # of permutations (even though some of them may be the same). The 4! is for the 4 e's that repeat, and the two 2!'s are for the 2 r's and the 2 m's. So, your actual answer will be: 10!/(4!*2!*2!) = 37800 Wow! A lot of combinations still! Hope that helps :)
Oh, my! I seem to have made a small typo: "The total number of letters in the word "remembered" is 9. Therefore, the TOTAL number of combinations is 10!." The total number of letters in "remembered" is actually 10, as a little counting should tell you. Sorry!
I understand now thanks to the both of you :)
Join our real-time social learning platform and learn together with your friends!