FEEBLENESS To have three E's together we have to find the number of all cases of distinguishable arrangements of these 8 things B,E,F,L,N,S,S,(EEE) and divide it by the number of all cases of distinguishable arrangements of these 10 things: B,E,E,E,E,F,L,N,S,S, The answer is= = = = However you may think it's not that because there are indistinguishable letters E and S. But we must divide both numerator and deminator by the same number to "unorder" them. To explain that: Let's start out making the E's and S's distinguishable B, E1, E2, E3, E4, F, L, N, S1, S2 There would be 10! ways to arrange those if we could tell the difference between the E's and the S's. But we can't. So 10! counts this too many times. We need to find out how many times too many 10! counts any arrangement. To find that, look at an arbitrary arranglement of those 10 distinguishable things, say this one: LE4FS2BE2NS1E3E1 There are 4! ways the 4 subscripts of E could be arranged, and for each of those ways, there are 2! ways the subscripts of S could be arranged. So the number of times too many which 10! counts the arrangement of LEFSBENSEE is 4!2! However, any arbitrary distinguishable arrangement of the 8! when the E's are together, say, S2L(E4E1E3)FBE2S1L is also counted 4!2! times too many among the 8!, so we would divide it by the same number to "unorder" it. So technically we would do it this way: Edwin