SOLVER7 Study. Nothing Else.
Exercise 6.3 Q11(iii)

In how many ways can the letters of the word \(PERMUTATIONS\) be arranged if the there are always 4 letters between \(P\) and \(S\ ?\)

CBSE Class 11 Maths · Permutations and Combinations

Solution

👶 Simple Explanation

Simple Explanation

Imagine placing 12 letter cards in a row of 12 chairs. Two special cards, P and S, must always have exactly 4 other cards sitting between them. Only 7 pairs of chairs are spaced that way. P and S can swap seats in each pair, giving 14 choices. The leftover 10 cards fill the remaining chairs, but two of them are identical T cards, so we avoid counting the same arrangement twice by dividing by 2. Multiply everything together and you get the total number of unique arrangements.

Answer: The number of arrangements is \( 14 \times \dfrac{10!}{2!} = 25401600 \).

📖 Arrangements of PERMUTATIONS with 4 Letters Between P and S

Detailed Explanation

The word PERMUTATIONS has 12 letters. Let us list them: P, E, R, M, U, T, A, T, I, O, N, S. Notice the letter T repeats twice; all other letters are distinct. When arranging letters with repetition, the total arrangements are divided by the factorial of each repeated letter's count. Here the special condition is that there must always be exactly 4 letters between P and S. So we first count how many position-pairs allow P and S to have 4 letters between them, then arrange P and S in those positions, and finally arrange the remaining 10 letters (which contain the two T's) in the remaining 10 slots.

Formula Used

Number of arrangements of \( n \) objects where one letter repeats \( p \) times is \( \dfrac{n!}{p!} \). Fundamental principle of counting: total ways = (ways for choice 1) \( \times \) (ways for choice 2) \( \times \cdots \)

Solution

  1. Step 1: Identify the letters and positions. PERMUTATIONS has 12 letters occupying positions \( 1, 2, 3, \ldots, 12 \). The letter T appears twice; every other letter appears once.
  2. Step 2: Understand the condition. There must be exactly 4 letters between P and S. If P is at position \( i \) and S is at position \( j \), then the number of letters between them is \( |i - j| - 1 = 4 \), which gives \( |i - j| = 5 \).
  3. Step 3: Count the ordered position-pairs where the gap is 5. The pairs of positions differing by 5 are: \( (1,6), (2,7), (3,8), (4,9), (5,10), (6,11), (7,12) \). That is 7 such pairs of positions.
  4. Step 4: Place P and S in each chosen pair. For each of the 7 pairs, P and S can be arranged in \( 2 \) ways (P first then S, or S first then P). So the number of ways to place P and S is \( 7 \times 2 = 14 \).
  5. Step 5: Arrange the remaining letters. After placing P and S, the other 10 letters are E, R, M, U, T, A, T, I, O, N. These fill the remaining 10 positions. Since T repeats twice, the number of arrangements is \[ \frac{10!}{2!}. \]
  6. Step 6: Apply the fundamental principle of counting. Multiply the ways to place P and S by the ways to arrange the rest: \[ 14 \times \frac{10!}{2!}. \] Now compute \( 10! = 3628800 \), so \( \dfrac{10!}{2!} = 1814400 \).
  7. Step 7: Final multiplication: \[ 14 \times 1814400 = 25401600. \]

Final Answer

The number of arrangements is \( 14 \times \dfrac{10!}{2!} = 25401600 \).

Common Mistake

A common mistake is forgetting that P and S can be swapped in each position-pair (multiplying by only 7 instead of \( 7 \times 2 = 14 \)), or forgetting to divide by \( 2! \) for the repeated letter T, which would give a wrong, larger count.

🪜 Step-by-step Solution

Step-by-step Solution

  1. Step 1: List all 12 letters of PERMUTATIONS: P, E, R, M, U, T, A, T, I, O, N, S. Observe that the letter T appears twice and every other letter appears exactly once. — Reason: Identifying repetitions is essential because repeated letters reduce the total count of distinct arrangements.
  2. Step 2: Translate the condition "exactly 4 letters between P and S" into a positional gap. If P is at position \( i \) and S is at position \( j \), then the number of letters between them equals \( |i - j| - 1 \). Setting this equal to 4 gives \[ |i - j| - 1 = 4 \] so \[ |i - j| = 5 \] — Reason: Converting the word-condition into an algebraic gap allows us to systematically list all valid position-pairs.
  3. Step 3: List every ordered pair of positions \( (i, j) \) from the 12 available slots such that \( |i - j| = 5 \). The unordered pairs are: \( (1,6),\, (2,7),\, (3,8),\, (4,9),\, (5,10),\, (6,11),\, (7,12) \). That gives 7 distinct unordered pairs. — Reason: Counting valid slot-pairs tells us how many locations are available for placing P and S under the given constraint.
  4. Step 4: For each of the 7 unordered pairs, P and S can be placed in 2 ways (P in the smaller-numbered slot and S in the larger, or vice versa). So the total number of ways to place P and S is \[ 7 \times 2 = 14 \] — Reason: P and S are distinct letters, so swapping their positions produces a different arrangement.
  5. Step 5: After fixing P and S in 2 of the 12 positions, the remaining 10 positions must be filled with the 10 leftover letters: E, R, M, U, T, A, T, I, O, N. These 10 letters contain exactly one repeated letter (T appears twice). The number of distinct arrangements of these 10 letters is \[ \frac{10!}{2!} \] — Reason: Dividing by \( 2! \) corrects for the two identical T's, which would otherwise produce duplicate arrangements.
  6. Step 6: Apply the Fundamental Counting Principle: multiply the number of ways to place P and S by the number of ways to arrange the remaining 10 letters. \[ \text{Total arrangements} = 14 \times \frac{10!}{2!} \] Evaluating: \( 10! = 3628800 \) and \( 2! = 2 \), so \[ 14 \times \frac{3628800}{2} = 14 \times 1814400 = 25401600 \] — Reason: The two sub-tasks (placing P, S and filling the rest) are independent, so their counts multiply.

Final Answer

The number of arrangements is \( 14 \times \dfrac{10!}{2!} = 25401600 \).

Common Mistake

One common mistake: students count only 7 ways to place P and S (forgetting that P and S can be swapped in each pair of positions), giving half the correct answer. Always remember that two distinct letters in two chosen slots can be arranged in \( 2! = 2 \) ways.

✍️ Exam-ready Answer

Exam-ready Answer

  1. Step 1: PERMUTATIONS has 12 positions; T repeats twice. Condition: exactly 4 letters between P and S, so positions of P and S differ by 5, i.e., \\ |i - j| = 5 \\ .
  2. Step 2: Position-pairs with difference 5: \\ (1,6),(2,7),(3,8),(4,9),(5,10),(6,11),(7,12) \\ — giving 7 pairs. P and S can be swapped in each pair, so ways to place P and S \\ = 7 \times 2 = 14 \\ .
  3. Step 3: Remaining 10 letters (including two T's) fill the 10 remaining positions in \\ \dfrac{10!}{2!} \\ ways.
  4. Step 4: Total arrangements \\ = 14 \times \dfrac{10!}{2!} = 14 \times 1814400 = 25401600 \\ .

Answer: The number of arrangements is \( 14 \times \dfrac{10!}{2!} = 25401600 \).

➕ More Examples

More Examples

Example 1

Question: In how many ways can the letters of the word MATHEMATICS be arranged so that there are always exactly 3 letters between M (first occurrence) and S?

Solution: Step 1: Identify the letters in MATHEMATICS. The letters are: M, A, T, H, E, M, A, T, I, C, S — a total of 11 letters. Repeated letters: M appears 2 times, A appears 2 times, T appears 2 times. Step 2: Treat the constraint on M (first M) and S. We need exactly 3 letters between one M and S. Think of the pair (M, S) as occupying positions \( (i, i+4) \) in the 11-letter arrangement, so there are exactly 3 letters strictly between them. Step 3: Count valid position pairs for (M, S). If M is at position \( i \) and S is at position \( i + 4 \), then \( i \) can range from 1 to 7, giving 7 pairs. Since M and S can be swapped (S first, M later), we get \( 7 \times 2 = 14 \) ordered position pairs. Step 4: Fix one M and S in their positions; arrange the remaining letters. After placing one M and S, the remaining 9 letters to be placed in the remaining 9 positions are: M, A, T, H, E, A, T, I, C. Repeated among these: A appears 2 times, T appears 2 times. Number of arrangements of these 9 letters: \[ \frac{9!}{2! \times 2!} \] Step 5: Calculate. \[ 9! = 362880 \] \[ \frac{362880}{2 \times 2} = \frac{362880}{4} = 90720 \] Step 6: Total arrangements. \[ \text{Total} = 14 \times 90720 = 1270080 \]

Answer: 1,270,080

Example 2

Question: In how many ways can the letters of the word REVOLUTION be arranged so that there are always exactly 2 letters between R and N?

Solution: Step 1: Identify the letters in REVOLUTION. The letters are: R, E, V, O, L, U, T, I, O, N — a total of 10 letters. Repeated letter: O appears 2 times. All others appear once. Step 2: Identify valid position pairs for R and N with exactly 2 letters between them. If R is at position \( i \) and N is at position \( i + 3 \), then exactly 2 letters lie between them. With 10 positions, \( i \) ranges from 1 to 7, giving 7 such pairs. Since R and N can swap roles (N before R), we have \( 7 \times 2 = 14 \) ordered position pairs. Step 3: Arrange the remaining letters in the remaining positions. After placing R and N, the remaining 8 letters are: E, V, O, L, U, T, I, O. Repeated among these: O appears 2 times. Number of ways to arrange these 8 letters in the 8 remaining positions: \[ \frac{8!}{2!} \] Step 4: Calculate. \[ 8! = 40320 \] \[ \frac{40320}{2} = 20160 \] Step 5: Total arrangements. \[ \text{Total} = 14 \times 20160 = 282240 \]

Answer: 2,82,240

🎯 Try a Similar Question

Try a Similar Question

Question: In how many ways can the letters of the word COMBINATIONS be arranged if there are always exactly 3 letters between C and S?

Solution

  1. Step 1: Identify the letters in COMBINATIONS: The word COMBINATIONS has 12 letters: C, O, M, B, I, N, A, T, I, O, N, S. The repeated letters are: O (appears 2 times), I (appears 2 times), N (appears 2 times). The total number of letters is 12.
  2. Step 2: Set up the block with exactly 3 letters between C and S: We need exactly 3 letters between C and S. Treat C, the 3 letters in between, and S as a block of 5 consecutive positions. The block looks like: C _ _ _ S or S _ _ _ C.
  3. Step 3: Count the number of valid positions for this block: The block occupies 5 consecutive positions in a 12-letter arrangement. The starting position of the block can be 1, 2, 3, ..., 8. So there are 8 possible positions for the block. Since C and S can swap places (C _ _ _ S or S _ _ _ C), each position gives 2 arrangements. Total ways to place the block = \( 8 \times 2 = 16 \).
  4. Step 4: Arrange the 3 letters inside the block: The 3 letters placed between C and S are chosen from the remaining 10 letters (all letters except C and S): O, M, B, I, N, A, T, I, O, N. The number of ways to arrange 3 letters in the 3 middle slots of the block (using letters from these 10, treating them as distinct for now) is the number of ways to pick and arrange 3 from 10 distinct-position letters. However, since we will arrange ALL remaining letters together (outside and inside the block), we handle internal and external arrangements together in the next step.
  5. Step 5: Arrange all remaining letters in the remaining positions: After fixing the block of 5 (C, 3 middle, S) in its chosen position, there are \( 12 - 5 = 7 \) positions left for the remaining 7 letters, and 3 positions inside the block for the middle letters. Together, all 10 letters (excluding C and S) must fill \( 3 + 7 = 10 \) spots. These 10 letters are: O, M, B, I, N, A, T, I, O, N, which contain O twice, I twice, and N twice. The number of ways to arrange these 10 letters in 10 spots is: \[ \frac{10!}{2! \times 2! \times 2!} \]
  6. Step 6: Calculate the total number of arrangements: Total arrangements = (valid block positions) \( \times \) (arrangements of remaining 10 letters) \[ = 16 \times \frac{10!}{2! \times 2! \times 2!} \] Now compute: \( 10! = 3628800 \) and \( 2! \times 2! \times 2! = 8 \). So: \[ = 16 \times \frac{3628800}{8} = 16 \times 453600 = 7257600 \]

Answer: The total number of arrangements is \[ 16 \times \frac{10!}{2! \times 2! \times 2!} = 16 \times 453600 = 7257600 \]

Everything you get with Solver7

More questions in Permutations and Combinations