SOLVER7 Study. Nothing Else.
Chapter 6 Examples Q16(i)

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

Solution

👶 Simple Explanation

Simple Explanation

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 \).

📖 Arrangements of the Letters of INDEPENDENCE

Detailed Explanation

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.

Formula Used

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} \]

Solution

  1. Step 1: Count the letters in the word INDEPENDENCE. There are \( 12 \) letters in total.
  2. Step 2: Identify the repeated letters. Count each distinct letter: N appears \( 3 \) times, E appears \( 4 \) times, D appears \( 2 \) times, and I, P, C each appear \( 1 \) time. Check: \( 3 + 4 + 2 + 1 + 1 + 1 = 12 \).
  3. Step 3: Apply the formula for arrangements with repetition. Total arrangements \[ = \frac{12!}{3!\, 4!\, 2!} \]
  4. Step 4: Compute the value. Here \( 12! = 479001600 \), and \( 3! = 6 \), \( 4! = 24 \), \( 2! = 2 \), so the denominator is \( 6 \times 24 \times 2 = 288 \). \[ \frac{479001600}{288} = 1663200 \] So there are \( 1663200 \) total arrangements.
  5. Step 5: Now apply the condition 'starts with P'. Fix the letter P in the first position. Since there is only one P, this uses it up, and we are left with \( 11 \) letters to arrange in the remaining places.
  6. Step 6: Count the remaining letters: N appears \( 3 \) times, E appears \( 4 \) times, D appears \( 2 \) times, and I, C each appear once (P is already placed). The number of arrangements of these \( 11 \) letters is \[ \frac{11!}{3!\, 4!\, 2!} \]
  7. Step 7: Compute this value. Here \( 11! = 39916800 \), and the denominator is again \( 288 \). \[ \frac{39916800}{288} = 138600 \] So there are \( 138600 \) arrangements that start with P.

Final Answer

Total number of arrangements \( = \dfrac{12!}{3!\,4!\,2!} = 1663200 \). Number of arrangements starting with P \( = \dfrac{11!}{3!\,4!\,2!} = 138600 \).

Common Mistake

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.

🪜 Step-by-step Solution

Step-by-step Solution

  1. Step 1: Write out every letter of the word INDEPENDENCE and count them: I, N, D, E, P, E, N, D, E, N, C, E. Total = \( 12 \) letters. — Reason: We need the value of \( n \) for the formula, and counting carefully prevents errors in later calculations.
  2. Step 2: Identify how many times each letter appears: E appears \( 4 \) times, N appears \( 3 \) times, D appears \( 2 \) times, and each of I, P, C appears \( 1 \) time. Quick check: \( 4 + 3 + 2 + 1 + 1 + 1 = 12 \). — Reason: We must know which letters are repeated so we can divide out the overcounting caused by swapping identical letters.
  3. Step 3: Substitute into the formula. The repeated letters contribute \( 4! \) for E, \( 3! \) for N, and \( 2! \) for D (letters appearing only once contribute \( 1! = 1 \), which does not change the result): \[ \text{Total arrangements} = \frac{12!}{4!\, 3!\, 2!} \] — Reason: Dividing by each repeated letter's factorial removes arrangements that look identical because the repeated letters were swapped among themselves.
  4. Step 4: Compute the denominator first: \( 4! = 24 \), \( 3! = 6 \), \( 2! = 2 \), so denominator \( = 24 \times 6 \times 2 = 288 \). Then \( 12! = 479001600 \). Therefore: \[ \frac{479001600}{288} = 1663200 \] — Reason: Breaking the computation into smaller parts (denominator first, then division) reduces arithmetic errors.
  5. Step 5: For arrangements that start with P: fix the letter P in position 1. The remaining \( 11 \) positions are filled by the other 11 letters — E\((\times 4)\), N\((\times 3)\), D\((\times 2)\), I\((\times 1)\), C\((\times 1)\). — Reason: Fixing P at the start reduces the problem to arranging 11 letters, and the repetition counts among the remaining letters are unchanged.
  6. Step 6: Apply the formula again with \( n = 11 \) and the same repeated-letter factorials \( 4!,\, 3!,\, 2! \): \[ \text{Arrangements starting with P} = \frac{11!}{4!\, 3!\, 2!} \] Now \( 11! = 39916800 \), and the denominator is still \( 288 \): \[ \frac{39916800}{288} = 138600 \] — Reason: Using the same denominator is valid because fixing P does not alter the multiplicities of the remaining repeated letters.

Final Answer

Total number of arrangements \( = \dfrac{12!}{3!\,4!\,2!} = 1663200 \). Number of arrangements starting with P \( = \dfrac{11!}{3!\,4!\,2!} = 138600 \).

Common Mistake

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.

✍️ Exam-ready Answer

Exam-ready Answer

  1. Step 1: INDEPENDENCE has 12 letters: N repeats 3 times, E repeats 4 times, D repeats 2 times; I, P, C appear once each.
  2. Step 2: Total arrangements \[ = \frac{12!}{3!\,4!\,2!} = \frac{479001600}{6 \times 24 \times 2} = \frac{479001600}{288} = 1663200 \]
  3. Step 3: Fix P in position 1; arrange remaining 11 letters (N\(\times 3\), E\(\times 4\), D\(\times 2\), I, C): \[ \frac{11!}{3!\,4!\,2!} = \frac{39916800}{288} = 138600 \]

Answer: Total number of arrangements \( = \dfrac{12!}{3!\,4!\,2!} = 1663200 \). Number of arrangements starting with P \( = \dfrac{11!}{3!\,4!\,2!} = 138600 \).

➕ More Examples

More Examples

Example 1

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\)

Example 2

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\)

🎯 Try a Similar Question

Try a Similar Question

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?

Solution

  1. Step 1: Identify the letters and their frequencies: The word MEDITERRANEAN has 13 letters. Let us list each letter and how many times it appears: M — 1, E — 3, D — 1, I — 1, T — 1, R — 2, A — 2, N — 2. Total letters: \( 1 + 3 + 1 + 1 + 1 + 2 + 2 + 2 = 13 \).
  2. Step 2: Apply the multiset permutation formula for total arrangements: The total number of distinct arrangements is \[ \frac{13!}{3! \, 2! \, 2! \, 2!} \] where \( 3! \) accounts for the 3 E's, and each \( 2! \) accounts for the repeated R's, A's, and N's respectively.
  3. Step 3: Compute the total arrangements: We evaluate \[ \frac{13!}{3! \, 2! \, 2! \, 2!} = \frac{6227020800}{6 \times 2 \times 2 \times 2} = \frac{6227020800}{48} = 129729600. \]
  4. Step 4: Count arrangements starting with D: If the first letter is fixed as D, we arrange the remaining 12 letters: M, E, E, E, I, T, R, R, A, A, N, N. The number of such arrangements is \[ \frac{12!}{3! \, 2! \, 2! \, 2!} \] since the repeated letters among the remaining 12 are still E (×3), R (×2), A (×2), N (×2).
  5. Step 5: Compute arrangements starting with D: We evaluate \[ \frac{12!}{3! \, 2! \, 2! \, 2!} = \frac{479001600}{6 \times 2 \times 2 \times 2} = \frac{479001600}{48} = 9979200. \]

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 \).

Everything you get with Solver7

More questions in Permutations and Combinations