Question

which of the following expressions represent the number of distinguishable permutations of the letters of the word conclusion​

Answer 1

Answer:

See explanation

Step-by-step explanation:

In most cases, we run into the problem of arranging objects that are repeated. This often occurs when we have a word that has repeated letters.

Let us recall that permutation deals with arrangements which are distinguishable.

Hence, for the word CONCLUSION, the number of distinguishable arrangements are;

10!/2!2!2!