Find the number of distinguishable ways the word "STATISTICS" can be arranged if only $1$ T will be alone while the other $2$ T will be together.
How do I solve this? Or does it need complex workings?
I Have done many practices on permutation and Combination. But all I see all the time is questions such as "Number of ways letter T come together" or Number of ways no $2$ Ts are together which also means T cannot be together.
Therefore, the question above is come out by my own self. How do we attempt it?