In how many ways can the letters of the word \(PERMUTATIONS\) be arranged if the words start with \(P\) and end with \(S\),
CBSE Class 11 Maths · Permutations and Combinations
CBSE Class 11 Maths · Permutations and Combinations
Imagine arranging letter tiles on a shelf. The word PERMUTATIONS has 12 tiles, but two tiles look exactly the same — both say T. Now, someone says the shelf must always start with P and end with S. Those two spots are already taken! Only 10 tiles remain to be shuffled around. Because two of those tiles are identical, swapping them gives the same look. So we divide by 2 to avoid counting twins twice. The total comes out to 1814400 different arrangements.
Answer: The number of arrangements starting with P and ending with S is \[ \frac{10!}{2!} = 1814400 \]
The word PERMUTATIONS has 12 letters. First we check for repeated letters, because repetition changes how we count arrangements. Counting the letters, we get P, E, R, M, U, T, A, T, I, O, N, S. Here the letter T appears twice and every other letter appears once. When some letters repeat, the number of distinct arrangements of \( n \) letters where one letter repeats \( p \) times is \( \frac{n!}{p!} \). In this problem the first and last positions are fixed: the arrangement must start with P and end with S. So we place P and S first, and then only arrange the remaining letters in the middle positions.
Number of arrangements of \( n \) objects where one object repeats \( p \) times is \[ \frac{n!}{p!} \]
The number of arrangements starting with P and ending with S is \[ \frac{10!}{2!} = 1814400 \]
A common mistake is to divide by \( 2! \) twice or to still count the full \( 12! \) instead of arranging only the remaining \( 10 \) letters after fixing P and S. Remember: once P and S are fixed at the ends, only the \( 10 \) middle letters are arranged, and division by \( 2! \) is done only once for the repeated T.
The number of arrangements starting with P and ending with S is \[ \frac{10!}{2!} = 1814400 \]
One common mistake: students forget that T is repeated and compute \( 10! \) instead of \( \frac{10!}{2!} \), which overcounts arrangements by treating the two T's as distinguishable.
Answer: The number of arrangements starting with P and ending with S is \[ \frac{10!}{2!} = 1814400 \]
Question: In how many ways can the letters of the word DISTRIBUTIONS be arranged if the arrangement must start with D and end with N?
Solution: Step 1: Write out the word and count letters. The word DISTRIBUTIONS has 13 letters: D, I, S, T, R, I, B, U, T, I, O, N, S. Step 2: Fix the first and last positions. The first position is fixed as D and the last position is fixed as N. These two letters are now placed and removed from the pool. Remaining letters to arrange in the middle 11 positions: I, S, T, R, I, B, U, T, I, O, S That is 11 letters. Step 3: Count the repetitions among the remaining 11 letters. Letter I appears 3 times, letter T appears 2 times, letter S appears 2 times. Step 4: Apply the formula. Number of arrangements \[ = \frac{11!}{3! \times 2! \times 2!} \] Calculate the denominator: \[ 3! \times 2! \times 2! = 6 \times 2 \times 2 = 24 \] Calculate \( 11! \): \[ 11! = 39916800 \] So the number of arrangements is: \[ \frac{39916800}{24} = 1663200 \]
Answer: 1,663,200
Question: In how many ways can the letters of the word ASSASSINATION be arranged so that the arrangement begins with A and ends with N?
Solution: Step 1: Write out the word and count letters. The word ASSASSINATION has 13 letters: A, S, S, A, S, S, I, N, A, T, I, O, N. Frequency of each letter: A appears 3 times, S appears 4 times, I appears 2 times, N appears 2 times, T appears 1 time, O appears 1 time. Step 2: Fix the first and last positions. The first position is fixed as A and the last position is fixed as N. Remove one A from the pool and one N from the pool. Remaining letters for the middle 11 positions: A, A, S, S, S, S, I, I, N, T, O That is 11 letters. Step 3: Count the repetitions among the remaining 11 letters. A appears 2 times, S appears 4 times, I appears 2 times, N appears 1 time, T appears 1 time, O appears 1 time. Step 4: Apply the formula. Number of arrangements \[ = \frac{11!}{2! \times 4! \times 2!} \] Calculate the denominator: \[ 2! \times 4! \times 2! = 2 \times 24 \times 2 = 96 \] Calculate \( 11! \): \[ 11! = 39916800 \] So the number of arrangements is: \[ \frac{39916800}{96} = 415800 \]
Answer: 415,800
Question: In how many ways can the letters of the word COMBINATIONS be arranged if each arrangement starts with C and ends with N?
Answer: The number of arrangements of the letters of COMBINATIONS starting with C and ending with N is \[ \frac{10!}{2! \times 2!} = 907200 \]