Related Formula
Total Words = Σ Permutations of each selection partition distribution case$$\text{Total Words} = \sum \text{Permutations of each selection partition distribution case}$$
Core Logic
The word MATHS has 5 distinct letters: {M, A, T, H, S}. We need to form 6-letter words such that any chosen letter appears ≥ 2$\geq 2$ \times. We analyze combinations by structural frequency cases.
Case 1: Single letter used 6 \times
Format: a a a a a a$a a a a a a$
Choose 1 letter out of 5: 51 = 5$\binom{5}{1} = 5$ words.
Case 2: Two distinct letters used
Subcase 2a: One letter 4 \times, another 2 \times (aaaa bb$aaaa bb$)
Words = 52 × ( (6!)/(4! 2!) × 2! ) = 10 × (15 × 2) = 300$$\text{Words} = \binom{5}{2} \times \left( \frac{6!}{4! 2!} \times 2! \right) = 10 \times (15 \times 2) = 300$$
Subcase 2b: Both letters used 3 \times each (aaa bbb$aaa bbb$)
Words = 52 × (6!)/(3! 3!) = 10 × 20 = 200$$\text{Words} = \binom{5}{2} \times \frac{6!}{3! 3!} = 10 \times 20 = 200$$
Total for Case 2 = 300 + 200 = 500$= 300 + 200 = 500$ words.
Case 3: Three distinct letters used
Format: Each letter appears exactly 2 \times (aa bb cc$aa bb cc$)
Words = 53 × (6!)/(2! 2! 2!) = 10 × 90 = 900 words.$$\text{Words} = \binom{5}{3} \times \frac{6!}{2! 2! 2!} = 10 \times 90 = 900\text{ words.}$$
Step 1: Calculate Total Words
Total Words = 5 + 500 + 900 = 1405$$\text{Total Words} = 5 + 500 + 900 = 1405$$
Pattern Recognition
When constraints enforce frequencies ≥ 2$\geq 2$, organize calculations strictly by number of distinct letters to cover all possibilities without overcounting.
Chapter Mix
Class 11 Mathematics: Permutations and Combinations