Find the number of arrangements of the letters of the word \(INDEPENDENCE.\) In how many of these arrangements, do the words start with P
CBSE Class 11 Maths · Permutations and Combinations
CBSE Class 11 Maths · Permutations and Combinations
Imagine you have 12 letter tiles spelling INDEPENDENCE. You want to arrange them in a row. Some tiles look exactly the same — like four E tiles or three N tiles. Swapping identical tiles gives the same word, not a new one. So we count all arrangements and then remove the repeated ones by dividing. Fixing P at the start is like saving one seat for P and arranging only the leftover tiles.
Answer: Total number of arrangements \( = \dfrac{12!}{3!\,4!\,2!} = 1663200 \). Number of arrangements starting with P \( = \dfrac{11!}{3!\,4!\,2!} = 138600 \).
When we arrange objects and some of them are identical, we cannot treat them as all different. If we had all distinct letters, the number of arrangements of \( n \) letters would be \( n! \). But if a letter repeats \( p \) times, swapping those identical letters among themselves does not create a new arrangement, so we must divide by \( p! \) for each repeated letter. This gives the formula for permutations of objects that are not all distinct. To handle a condition like 'starts with P', we simply fix P in the first position and count the arrangements of the remaining letters.
Number of arrangements of \( n \) objects where a letter repeats \( p_1 \) times, another repeats \( p_2 \) times, etc.: \[ \frac{n!}{p_1!\, p_2!\, \cdots} \]
Total number of arrangements \( = \dfrac{12!}{3!\,4!\,2!} = 1663200 \). Number of arrangements starting with P \( = \dfrac{11!}{3!\,4!\,2!} = 138600 \).
A common mistake is forgetting to divide by the factorials of ALL repeated letters (for example dividing only by \( 4! \) for E and ignoring that N repeats \( 3 \) times and D repeats \( 2 \) times). Every repeated letter must contribute a factorial in the denominator.
Total number of arrangements \( = \dfrac{12!}{3!\,4!\,2!} = 1663200 \). Number of arrangements starting with P \( = \dfrac{11!}{3!\,4!\,2!} = 138600 \).
One common mistake: forgetting to update \( n \) from 12 to 11 when P is fixed at the start — students sometimes write \( \dfrac{12!}{4!\,3!\,2!} \) even for the restricted case, which overcounts by a factor of 12.
Answer: Total number of arrangements \( = \dfrac{12!}{3!\,4!\,2!} = 1663200 \). Number of arrangements starting with P \( = \dfrac{11!}{3!\,4!\,2!} = 138600 \).
Question: Find the total number of arrangements of the letters of the word MATHEMATICS. In how many of these arrangements does the word start with the letter C?
Solution: Step 1: Identify the letters and their frequencies in MATHEMATICS. The word MATHEMATICS has 11 letters: M, A, T, H, E, M, A, T, I, C, S. Frequencies: M appears 2 times, A appears 2 times, T appears 2 times, H appears 1 time, E appears 1 time, I appears 1 time, C appears 1 time, S appears 1 time. Step 2: Total number of arrangements of all 11 letters. Using the multiset permutation formula: \[\text{Total arrangements} = \frac{11!}{2!\, 2!\, 2!}\] Now, \(11! = 39916800\) and \(2! \times 2! \times 2! = 2 \times 2 \times 2 = 8\). So the total number of arrangements is: \[\frac{39916800}{8} = 4989600\] Step 3: Arrangements starting with C. Fix C in the first position. The remaining 10 letters are: M, A, T, H, E, M, A, T, I, S. Frequencies in the remaining letters: M appears 2 times, A appears 2 times, T appears 2 times, and H, E, I, S each appear 1 time. Number of arrangements of these 10 letters: \[\frac{10!}{2!\, 2!\, 2!}\] Now, \(10! = 3628800\) and \(2! \times 2! \times 2! = 8\). So the number of arrangements starting with C is: \[\frac{3628800}{8} = 453600\]
Answer: Total arrangements: \(4989600\); Arrangements starting with C: \(453600\)
Question: Find the total number of arrangements of the letters of the word COMMITTEE. In how many of these arrangements does the word start with the letter O?
Solution: Step 1: Identify the letters and their frequencies in COMMITTEE. The word COMMITTEE has 9 letters: C, O, M, M, I, T, T, E, E. Frequencies: M appears 2 times, T appears 2 times, E appears 2 times, and C, O, I each appear 1 time. Step 2: Total number of arrangements of all 9 letters. Using the multiset permutation formula: \[\text{Total arrangements} = \frac{9!}{2!\, 2!\, 2!}\] Now, \(9! = 362880\) and \(2! \times 2! \times 2! = 2 \times 2 \times 2 = 8\). So the total number of arrangements is: \[\frac{362880}{8} = 45360\] Step 3: Arrangements starting with O. Fix O in the first position. The remaining 8 letters are: C, M, M, I, T, T, E, E. Frequencies in the remaining letters: M appears 2 times, T appears 2 times, E appears 2 times, and C, I each appear 1 time. Number of arrangements of these 8 letters: \[\frac{8!}{2!\, 2!\, 2!}\] Now, \(8! = 40320\) and \(2! \times 2! \times 2! = 8\). So the number of arrangements starting with O is: \[\frac{40320}{8} = 5040\]
Answer: Total arrangements: \(45360\); Arrangements starting with O: \(5040\)
Question: Find the number of arrangements of the letters of the word MEDITERRANEAN. In how many of these arrangements do the words start with the letter D?
Answer: Total number of arrangements \( = \dfrac{13!}{3! \, 2! \, 2! \, 2!} = 129729600 \). Number of arrangements starting with D \( = \dfrac{12!}{3! \, 2! \, 2! \, 2!} = 9979200 \).