Originally posted by McLake
METHOD I:
8C3 is obvious
to include both e's selection is e,e,# and there are 6 hashes. Order is not important (yet).
so no e must be 50 (8C3 - 6)
so arrangments are 50 * 3! (cause can arrange three ways) + 6 x 3!/2! (casue can arrange three ways but 2 of them are same due to e's).
METHOD II:
we have 8 letters to choose from
then 7
then 6
so 8*7*6 = 336
but 6*3 are the same
so no of combo = 336 - 18 = 318
I'm sorry to say that not only is 8C3 NOT obvious, it's also wrong.
For argument's sake, lets rename the 1st E "E1", and the 2nd E as "E2"
Then there would be 8C3 different ways of choosing 3 letters from the now-distinct 8.
However, now remember that in the real question, both E's are the same. So in all the cases where we only chose one "E" we've double-counted ($)(%)(E1) and ($)(%)(E2) have been considered different sets whereas in fact they are the same (since E1=E2)
NB: $, % are arbitrary letters.
So when there aren't 8 distinct letters (such as FREQUENT), there are less than 8C3 ways of choosing three.
There's a similar flaw in method 2 (we've all double-counted every word with only 1 'E')
To backtrack, we need to subtract every selection that has one 'E', i.e. 1 * 3 * 6 * 5 (one way to choose one 'E', 3 different places to put this 'E', 6 different letters to place the 1st non-'E', 5 different letters to place the 2nd non-'E')
318 - 90 = 228 which is my preferred answer.
Dumbarse: sorry, i dun usually show off - i'm just not used to ppl not believing me...