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

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

Solution

👶 Simple Explanation

Simple Explanation

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

📖 Arrangements of the Letters of INDEPENDENCE

Detailed Explanation

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.

Formula Used

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

Solution

  1. Step 1: Count the letters in INDEPENDENCE. Total letters \( = 12 \). The repeated letters are: N appears 3 times, D appears 2 times, E appears 4 times. The letters I, P, C each appear once.
  2. Step 2: Apply the formula for arrangements with repetition. The total number of arrangements is \[ \frac{12!}{3!\,2!\,4!} \] where \( 3! \) is for the three N's, \( 2! \) for the two D's, and \( 4! \) for the four E's.
  3. Step 3: Simplify the total. We have \( 12! = 479001600 \), \( 3! = 6 \), \( 2! = 2 \), \( 4! = 24 \). So the denominator is \( 6 \times 2 \times 24 = 288 \). Then \[ \frac{479001600}{288} = 1663200 \] Hence the total number of arrangements is \( 1663200 \).
  4. Step 4: Now fix I at the start and P at the end. Since I and P each occur only once, placing them in fixed positions leaves the middle 10 places to be filled by the remaining letters: N(3), D(2), E(4), C(1), which total \( 3+2+4+1 = 10 \) letters.
  5. Step 5: Arrange these 10 middle letters, again dividing by factorials of the repeated letters: \[ \frac{10!}{3!\,2!\,4!} \] Here \( 10! = 3628800 \) and the denominator is again \( 6 \times 2 \times 24 = 288 \).
  6. Step 6: Simplify the conditional count. \[ \frac{3628800}{288} = 12600 \] So the number of arrangements beginning with I and ending in P is \( 12600 \).

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

Common Mistake

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.

🪜 Step-by-step Solution

Step-by-step Solution

  1. Step 1: Write out every letter of INDEPENDENCE and tally its frequency: I appears 1 time, N appears 3 times, D appears 2 times, E appears 4 times, P appears 1 time, C appears 1 time. Quick check: \( 1 + 3 + 2 + 4 + 1 + 1 = 12 \) letters in total. — Reason: Before applying any formula we must know exactly how many letters there are and which ones repeat, because only repeated letters create duplicate arrangements.
  2. Step 2: Plug the counts into the formula. The total number of distinct arrangements of all 12 letters is \[ \frac{12!}{3!\, 2!\, 4!} \] where \( 3! \) accounts for the three identical N's, \( 2! \) for the two identical D's, and \( 4! \) for the four identical E's. — Reason: Letters that appear only once (I, P, C) contribute no repetition, so their factorials equal \( 1! = 1 \) and need not be written in the denominator.
  3. Step 3: Evaluate the denominator step by step. We have \( 3! = 6 \), \( 2! = 2 \), and \( 4! = 24 \). Multiplying these together: \( 6 \times 2 = 12 \), then \( 12 \times 24 = 288 \). So the denominator equals \( 288 \). — Reason: Computing the denominator separately keeps the arithmetic organised and reduces the chance of error.
  4. Step 4: Compute the total: \( 12! = 479001600 \). Dividing, \[ \frac{479001600}{288} = 1663200 \] — Reason: This gives the total number of distinct arrangements of the 12 letters of INDEPENDENCE.
  5. Step 5: For the second part, fix I in the first position and P in the last position. These two letters are now locked in place, so only the remaining \( 12 - 2 = 10 \) letters need to be arranged in the 10 middle positions. Those 10 letters are: N, N, N, D, D, E, E, E, E, C. — Reason: Fixing letters at specific positions reduces the problem to arranging a smaller set, and we check the repeated letters among those that remain.
  6. Step 6: Apply the formula to the 10 remaining letters. The repeated letters among them are still N (3 times), D (2 times), and E (4 times), so the number of valid arrangements is \[ \frac{10!}{3!\, 2!\, 4!} \] — Reason: The structure of repetitions among the 10 letters is identical to before; only the total count has dropped from 12 to 10.
  7. Step 7: Evaluate: \( 10! = 3628800 \) and the denominator is still \( 288 \). Therefore \[ \frac{3628800}{288} = 12600 \] — Reason: This is the number of distinct arrangements of INDEPENDENCE that begin with I and end with P.

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

Common Mistake

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.

✍️ Exam-ready Answer

Exam-ready Answer

  1. Step 1: INDEPENDENCE has 12 letters: N \( \times 3 \), D \( \times 2 \), E \( \times 4 \); all others appear once.
  2. Step 2: Total arrangements \[ = \frac{12!}{3!\,2!\,4!} = \frac{479001600}{6 \times 2 \times 24} = \frac{479001600}{288} = 1663200 \]
  3. Step 3: Fix I at position 1 and P at position 12; arrange remaining 10 letters (N \( \times 3 \), D \( \times 2 \), E \( \times 4 \), C \( \times 1 \)): \[ \frac{10!}{3!\,2!\,4!} = \frac{3628800}{288} = 12600 \]

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

➕ More Examples

More Examples

Example 1

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.

Example 2

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.

🎯 Try a Similar Question

Try a Similar Question

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?

Solution

  1. Step 1: Identify the letters and their frequencies in MATHEMATICS: The word MATHEMATICS has 11 letters. Let us list each letter and count its frequency: 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.
  2. Step 2: Total number of distinct arrangements: The total number of distinct arrangements of all 11 letters is obtained by dividing 11! by the factorials of the frequencies of the repeated letters (M, A, T each appear twice): \[ \text{Total arrangements} = \frac{11!}{2! \cdot 2! \cdot 2!} \] Now, \( 11! = 39916800 \) and \( 2! \cdot 2! \cdot 2! = 8 \), so the total is: \[ \frac{39916800}{8} = 4989600 \]
  3. Step 3: Set up the restricted arrangement (begins with C, ends with S): Fix C in the first position and S in the last position. These two letters are now used, so we arrange the remaining \( 11 - 2 = 9 \) letters in the middle 9 positions. The remaining letters are: M, A, T, H, E, M, A, T, I — that is, M (×2), A (×2), T (×2), H (×1), E (×1), I (×1).
  4. Step 4: Count arrangements of the remaining 9 letters: The number of distinct arrangements of these 9 letters (with M, A, T each repeated twice) is: \[ \frac{9!}{2! \cdot 2! \cdot 2!} \] Now, \( 9! = 362880 \) and \( 2! \cdot 2! \cdot 2! = 8 \), so: \[ \frac{362880}{8} = 45360 \]
  5. Step 5: State the final answers: Total distinct arrangements of the letters of MATHEMATICS = \( 4989600 \). The number of arrangements that begin with C and end in S = \( 45360 \).

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

Everything you get with Solver7

More questions in Permutations and Combinations