If you mean all 9-letter distinguishable sequences of letters, (not necessarily REAL words), then the answer isExplanation: If all 9 letters were distinguishable, as if it were pasSengEr the answer would be 9!. But we must divide by the number of ways the 2 s's and the 2 e's can be arranged. (The esses can go 2! ways, s S or S s, and the ees can go 2! ways e E or E e. So we divide by 2!2!) ---------------------------- However, if you mean REAL English language words, then there is no way mathematics can help you. But, you can go here: http://wordsnipe.com But you'll have to eliminate from the 332 the ones you don't want. --------------------------------- Edwin