You can put this solution on YOUR website! ELLIPSES has letters, , , and , , and
The formula for indistinguishable permutation is
n!/(n[1]!n[2]!.....n[k]!)
where is the total number of objects and are the number of indistinguishable objects.
We have , , and (, and will not make any difference); the formula then becomes:
=
=
=
=
There are distinguishable permutations of the word .