In how many ways can the letters of the word $\mathrm{ASSASSINATION} $ be arranged so that all the $\mathrm{S}$ 's are together?

Vedclass pdf generator app on play store
Vedclass iOS app on app store

In the given word $ASSASSINATION$, the letter $A$ appears $3$ times, $S$ appears $4$ times, $I$ appears $2$ times, $N$ appears $2$ times, and all the other letters appear only once. since all the words have to be arranged in such a way that all the $Ss$ are together, $SSSS$ is treated as a single object for the time being. This single object together with the remaining $9$ objects will account for $10$ objects.

These $10$ objects in which there are $3 \,As , 2$ $Is$, and $2 \,Ns$ can be arranged in $\frac{10 !}{3 ! 2 ! 2 !}$ ways.

Thus, Required number of ways of arranging the letters of the given word $=\frac{10 !}{3 ! 2 ! 2 !}=151200$

Similar Questions

A man has $7$ friends. In how many ways he can invite one or more of them for a tea party

If all the letters of the word $'GANGARAM'$ be arranged, then number of words in which exactly two vowels are together but no two $'G'$ occur together is-

A committee of $3$ persons is to be constituted from a group of $2$ men and $3$ women. In how many ways can this be done? How many of these committees would consist of $1$ man and $2$ women?

How many numbers of $6$ digits can be formed from the digits of the number $112233$

All the five digits numbers in which each successive digit exceeds its predecessor are arranged in the increasing order of their magnitude. The $97^{th}$ number in the list does not contain the digit: