ExamBro
ExamBro
COMEDK · Maths · 4. Permutation Combination

In how many ways can the word "CHRISTMAS" be arranged so that the letters '\(\mathrm{C}\)' and '\(\mathrm{M}\)' are never adjacent?

  1. A \(9!\times \dfrac{7}{2}\)
  2. B \(8!\times \dfrac{9}{2}\)
  3. C \(8!\times \dfrac{7}{2}\)
  4. D \(7!\times \dfrac{9}{2}\)
Verified Solution

Answer & Solution

Correct Answer

(C) \(8!\times \dfrac{7}{2}\)

Step-by-step Solution

Detailed explanation

The word CHRISTMAS contains 9 letters: C, H, R, I, S, T, M, A, S. The letter S repeats twice. The total number of arrangements is \(\dfrac{9!}{2!}\). To find the number of arrangements where C and M are never adjacent, we subtract the arrangements where C and M are adjacent from…