Q.In how many ways can the letters of the word PERMUTATIONS be arranged if the
You're viewing a preview — the full solution, concept, methods & PYQ mapping are locked.
Start your 14-day free trial to unlock the full solution →This problem is about counting permutations of the word PERMUTATIONS (12 letters, with T repeated twice). Each part uses a different constraint: fixing positions, treating vowels as a block, or fixing a gap between P and S. The answers are (i) 10!/2!, (ii) (8! × 5!)/2!, and (iii) 2 × 7! × 6P4.
Let’s first understand the word: PERMUTATIONS has 12 letters. The letters are: P, E, R, M, U, T, A, T, I, O, N, S. Notice that T appears twice — all other letters are distinct. This repetition will matter in every part.
The core idea in all three parts is permutations without repetition (except for the repeated T). When we arrange distinct objects, the number of ways is . When there are identical objects, we divide by the factorial of the count of each identical group. Here, only T is repeated, so the total unrestricted arrangements would be .
Now, each part imposes a different condition. We’ll handle them one by one.
Part (i): Words start with P and end with S
-
Fix the first and last positions.
If the word must start with P and end with S, then P and S are locked in place. That leaves 10 remaining positions (positions 2 through 11) to fill with the remaining 10 letters.
-
What are the remaining letters?
After removing one P and one S, we have: E, R, M, U, T, A, T, I, O, N. That’s 10 letters, with T appearing twice.
-
Count the arrangements of these 10 letters.
The number of distinct permutations of these 10 letters, accounting for the two identical T’s, is .
-
No further restrictions.
Since P and S are fixed, every arrangement of the middle 10 letters gives a valid word. So the total number is simply .
A common mistake is to forget the repeated T. If you write without dividing by , you’ll overcount by a factor of 2. Always check for identical letters in the remaining set.
When fixing letters at ends, treat them as already placed — you only permute the rest. This reduces the problem size instantly.
Part (ii): Vowels are all together
-
Identify the vowels.
In PERMUTATIONS, the vowels are: E, U, A, I, O. That’s 5 distinct vowels.
-
Treat the vowel group as a single block.
If all vowels must stay together, we can think of them as one “super-letter”. So now we have:
- The block of vowels (call it V)
- The consonants: P, R, M, T, T, N, S That’s 1 block + 7 consonants = 8 items in total.
-
But note: the consonants include two T’s.
So among these 8 items, the two T’s are identical. The number of distinct arrangements of these 8 items is .
-
Now arrange the vowels inside the block.
The 5 vowels are all distinct, so they can be arranged among themselves in ways.
-
Multiply the two counts.
Total arrangements = (arrangements of block + consonants) × (arrangements inside block)
When items must stay together, treat the group as one object, then multiply by internal arrangements. For identical objects, divide by the factorial of the repetition count.
The block itself is treated as a single entity, but its internal order matters. So we always multiply by the internal permutations.
Part (iii): There are always exactly 4 letters between P and S
-
Interpret the condition.
“4 letters between P and S” means that in the arrangement, the positions of P and S differ by exactly 5. For example, if P is at position , then S must be at position (or vice versa). So the pair (P, S) can appear in two orders: P _ _ _ _ S or S _ _ _ _ P.
-
First, decide the positions for P and S. …
Unlock everything free for 14 days
- Full step-by-step solutions
- Concept-first explanations
- Methods, shortcuts & mistakes
- PYQ mapping + timed mock tests
Full access for 14 days. No credit card required.