Find the number of arrangements of the letters of the word \(INDEPENDENCE.\) In how many of these arrangements, do the words begin with \(I\) and end in \(P\ ?\)
CBSE Class 11 Maths · Permutations and Combinations
CBSE Class 11 Maths · Permutations and Combinations
Imagine arranging 12 letter tiles from the word INDEPENDENCE on a shelf. Some tiles look exactly the same — there are 4 tiles marked E, 3 marked N, and 2 marked D. Swapping identical tiles gives the same arrangement, not a new one. So we count all possible arrangements and remove the extras caused by those look-alike tiles. Fixing I at the start and P at the end leaves only 10 tiles to shuffle, making the second count smaller.
Answer: Total number of arrangements \( = \dfrac{12!}{3!\,2!\,4!} = 1663200 \). Arrangements beginning with I and ending in P \( = \dfrac{10!}{3!\,2!\,4!} = 12600 \).
The word INDEPENDENCE has 12 letters, but some letters repeat. When we arrange objects where some are identical, we cannot simply use \( 12! \), because swapping two identical letters does not give a new arrangement. Instead we divide \( 12! \) by the factorial of the count of each repeated letter. First we must count how many times each letter occurs. In INDEPENDENCE the letters are: I(1), N(3), D(2), E(4), P(1), C(1). So we have one I, three N's, two D's, four E's, one P, one C, totalling \( 1+3+2+4+1+1 = 12 \) letters. For the second part, when the word must begin with I and end with P, we fix those two letters in position and only arrange the remaining 10 letters among the middle places.
Number of arrangements of \( n \) objects where they include \( p, q, r, \dots \) identical objects of each kind is \[ \frac{n!}{p!\,q!\,r!\cdots} \]
Total number of arrangements \( = \dfrac{12!}{3!\,2!\,4!} = 1663200 \). Arrangements beginning with I and ending in P \( = \dfrac{10!}{3!\,2!\,4!} = 12600 \).
A common mistake is to forget to divide by \( 3!\,2!\,4! \) and just compute \( 12! \), which counts identical letters as distinct. Another error in the second part is dividing \( 10! \) by an extra factorial (like treating I or P as repeated) even though they appear only once and are fixed at the ends.
Total number of arrangements \( = \dfrac{12!}{3!\,2!\,4!} = 1663200 \). Arrangements beginning with I and ending in P \( = \dfrac{10!}{3!\,2!\,4!} = 12600 \).
One common mistake: forgetting to include the repeated letters that remain after fixing I and P, and instead writing \( \frac{10!}{1} \) for the second part — always re-check the frequencies of the letters that are still free to move.
Answer: Total number of arrangements \( = \dfrac{12!}{3!\,2!\,4!} = 1663200 \). Arrangements beginning with I and ending in P \( = \dfrac{10!}{3!\,2!\,4!} = 12600 \).
Question: Find the total number of distinct arrangements of the letters of the word MISSISSIPPI. Also find how many of these arrangements begin with M and end with I.
Solution: The word MISSISSIPPI has 11 letters with the following repetitions: M appears 1 time, I appears 4 times, S appears 4 times, P appears 2 times. Total number of distinct arrangements: We need to arrange 11 letters where I repeats 4 times, S repeats 4 times, and P repeats 2 times. Total arrangements = \[ \frac{11!}{1! \cdot 4! \cdot 4! \cdot 2!} \] Calculating step by step: \[ 11! = 39916800 \] \[ 4! = 24, \quad 4! = 24, \quad 2! = 2 \] So the denominator is \( 1 \times 24 \times 24 \times 2 = 1152 \) Total arrangements = \[ \frac{39916800}{1152} = 34650 \] Now, for arrangements that begin with M and end with I: Fix M at the first position and I at the last position. We now arrange the remaining 9 letters: I (3 times), S (4 times), P (2 times). Number of such arrangements = \[ \frac{9!}{3! \cdot 4! \cdot 2!} \] \[ 9! = 362880 \] Denominator = \( 3! \times 4! \times 2! = 6 \times 24 \times 2 = 288 \) Number of arrangements beginning with M and ending with I = \[ \frac{362880}{288} = 1260 \]
Answer: Total distinct arrangements = 34650; Arrangements beginning with M and ending with I = 1260.
Question: Find the number of distinct arrangements of the letters of the word EXAMINATION. In how many of these arrangements do the words begin with E and end with N?
Solution: The word EXAMINATION has 11 letters. Let us list the frequency of each letter: E appears 1 time, X appears 1 time, A appears 2 times, M appears 1 time, I appears 2 times, N appears 2 times, T appears 1 time, O appears 1 time. Total letters = 11, with A repeating 2 times, I repeating 2 times, N repeating 2 times. Total number of distinct arrangements = \[ \frac{11!}{1! \cdot 1! \cdot 2! \cdot 1! \cdot 2! \cdot 2! \cdot 1! \cdot 1!} \] This simplifies to: \[ \frac{11!}{2! \cdot 2! \cdot 2!} \] \[ 11! = 39916800 \] Denominator = \( 2 \times 2 \times 2 = 8 \) Total arrangements = \[ \frac{39916800}{8} = 4989600 \] Now, for arrangements that begin with E and end with N: Fix E at the first position and N at the last position. The remaining 9 letters to arrange are: X, A, M, I, N, A, T, I, O — that is, A (2 times), I (2 times), N (1 time), X, M, T, O each 1 time. Number of such arrangements = \[ \frac{9!}{2! \cdot 2! \cdot 1!} \] \[ 9! = 362880 \] Denominator = \( 2 \times 2 = 4 \) Number of arrangements beginning with E and ending with N = \[ \frac{362880}{4} = 90720 \]
Answer: Total distinct arrangements = 4989600; Arrangements beginning with E and ending with N = 90720.
Question: Find the total number of distinct arrangements of the letters of the word MATHEMATICS. In how many of these arrangements do the words begin with C and end in S?
Answer: Total number of distinct arrangements \( = \dfrac{11!}{2!\,2!\,2!} = 4989600 \). Arrangements beginning with C and ending in S \( = \dfrac{9!}{2!\,2!\,2!} = 45360 \).