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\)
The number of strictly increasing functions \(f\) from the set \(\{1, 2, 3, 4, 5, 6\}\) to the set \(\{1, 2, 3, ...., 9\}\) such that \(f(i)>i\) for \(1 \le i \le 6\), is equal to:
Permutation is the method or the act of arranging members of a set into an order or a sequence.
Combination is the method of forming subsets by selecting data from a larger set in a way that the selection order does not matter.