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

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

Solution

👶 Simple Explanation

Simple Explanation

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

📖 Arranging PERMUTATIONS starting with P and ending with S

Detailed Explanation

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.

Formula Used

Number of arrangements of \( n \) objects where one object repeats \( p \) times is \[ \frac{n!}{p!} \]

Solution

  1. Step 1: Count the letters. The word PERMUTATIONS has \( 12 \) letters: P, E, R, M, U, T, A, T, I, O, N, S. The letter T occurs twice; all other letters occur once.
  2. Step 2: Fix the end letters. The word must start with P and end with S. So P is placed in the first position and S in the last position. These two positions are now fixed and cannot change.
  3. Step 3: Find the remaining letters. After removing P and S, the letters left to arrange in the middle are E, R, M, U, T, A, T, I, O, N. That is \( 10 \) letters, and among them T still repeats twice.
  4. Step 4: Apply the arrangement formula. The number of ways to arrange these \( 10 \) letters with T repeating twice is \[ \frac{10!}{2!} \]
  5. Step 5: Compute the value. Since \( 10! = 3628800 \) and \( 2! = 2 \), we get \[ \frac{10!}{2!} = \frac{3628800}{2} = 1814400 \]

Final Answer

The number of arrangements starting with P and ending with S is \[ \frac{10!}{2!} = 1814400 \]

Common Mistake

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.

🪜 Step-by-step Solution

Step-by-step Solution

  1. Step 1: List and count all letters in PERMUTATIONS: P, E, R, M, U, T, A, T, I, O, N, S — that gives \( 12 \) letters in total. — Reason: Knowing the total count and identifying any repeats is the foundation before applying any formula.
  2. Step 2: Identify repeated letters. The letter T appears twice; every other letter appears exactly once. — Reason: Repeated letters reduce the number of distinct arrangements and must be accounted for by dividing by the appropriate factorial.
  3. Step 3: Fix P in the first position and S in the last position, as required by the problem. These two positions are now locked and contribute no further choices. — Reason: Constraints on specific positions must be satisfied before counting free arrangements, so we handle them first.
  4. Step 4: Remove P and S from the full set of letters. The letters remaining for the middle \( 10 \) positions are E, R, M, U, T, A, T, I, O, N. — Reason: Once P and S are fixed, only the leftover letters need to be arranged, so we work only with those.
  5. Step 5: Note that among these \( 10 \) remaining letters, T still repeats twice. Apply the repeated-arrangement formula with \( n = 10 \) and \( p = 2 \): \[ \frac{10!}{2!} \] — Reason: Dividing by \( 2! \) corrects for the fact that swapping the two identical T's does not create a new arrangement.
  6. Step 6: Evaluate the expression. We know \( 10! = 3628800 \) and \( 2! = 2 \), so \[ \frac{10!}{2!} = \frac{3628800}{2} = 1814400 \] — Reason: Computing the numerical value gives the final count of distinct valid arrangements.

Final Answer

The number of arrangements starting with P and ending with S is \[ \frac{10!}{2!} = 1814400 \]

Common Mistake

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.

✍️ Exam-ready Answer

Exam-ready Answer

  1. Step 1: PERMUTATIONS has 12 letters; T repeats twice. Fix P in position 1 and S in position 12.
  2. Step 2: Remaining letters to arrange: E, R, M, U, T, A, T, I, O, N — total \( 10 \) letters with T repeated \( 2 \) times.
  3. Step 3: Number of arrangements \( = \frac{10!}{2!} = \frac{3628800}{2} = 1814400 \)

Answer: The number of arrangements starting with P and ending with S is \[ \frac{10!}{2!} = 1814400 \]

➕ More Examples

More Examples

Example 1

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

Example 2

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

🎯 Try a Similar Question

Try a Similar Question

Question: In how many ways can the letters of the word COMBINATIONS be arranged if each arrangement starts with C and ends with N?

Solution

  1. Step 1: Count the letters in COMBINATIONS: The word COMBINATIONS has 12 letters: C, O, M, B, I, N, A, T, I, O, N, S. Let us list the frequency of each letter: C - 1, O - 2, M - 1, B - 1, I - 2, N - 2, A - 1, T - 1, S - 1.
  2. Step 2: Fix C at the first position and N at the last position: We place C at the first position and N at the last position. Since N appears twice in the word, placing one N at the last position leaves one N remaining among the other letters.
  3. Step 3: Identify the remaining letters: After fixing C at position 1 and one N at position 12, the remaining 10 letters to be arranged in the middle 10 positions are: O, M, B, I, A, T, I, O, N, S. Among these 10 letters, O repeats 2 times and I repeats 2 times, and the remaining N appears once.
  4. Step 4: Count the arrangements of the remaining 10 letters: The number of distinct arrangements of these 10 letters (with O repeated twice and I repeated twice) is: \[ \frac{10!}{2! \times 2!} \]
  5. Step 5: Calculate the value: We compute \( 10! = 3628800 \), and \( 2! \times 2! = 2 \times 2 = 4 \). Therefore the number of arrangements is \[ \frac{3628800}{4} = 907200 \]

Answer: The number of arrangements of the letters of COMBINATIONS starting with C and ending with N is \[ \frac{10!}{2! \times 2!} = 907200 \]

Everything you get with Solver7

More questions in Permutations and Combinations