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
CBSE Class 11 Maths · Permutations and Combinations
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 \).
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.
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 \)
The number of arrangements is \( 14 \times \dfrac{10!}{2!} = 25401600 \).
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.
The number of arrangements is \( 14 \times \dfrac{10!}{2!} = 25401600 \).
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.
Answer: The number of arrangements is \( 14 \times \dfrac{10!}{2!} = 25401600 \).
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
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
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?
Answer: The total number of arrangements is \[ 16 \times \frac{10!}{2! \times 2! \times 2!} = 16 \times 453600 = 7257600 \]