GATE 2020 CS – Question 52
The number of permutations of the characters in LILAC so that no character appears in its original position, if the two L's are indistinguishable, is ______.
Practise this question in The GATE Grind →
Show answer and explanation
Correct answer: 12 to 12
Explanation
LILAC has letters L, I, L, A, C in positions 1–5 (the L's are in positions 1 and 3). We want rearrangements (as distinct words) in which no letter stays in its original position.
**Restrictions on positions**
- Position 1 cannot be L, position 3 cannot be L.
- Position 2 cannot be I, position 4 cannot be A, position 5 cannot be C.
So the two L's must go in two of the positions $\{2,4,5\}$: $\binom32=3$ choices. Then place I, A, C in the three remaining positions, avoiding the one forbidden letter there.
- L's in $\{2,4\}$: I, A, C go to positions 1, 3, 5, with position 5 $\ne$ C. $3!-2!=4$ ways.
- L's in $\{2,5\}$: I, A, C go to positions 1, 3, 4, with position 4 $\ne$ A. $3!-2!=4$ ways.
- L's in $\{4,5\}$: I, A, C go to positions 1, 2, 3, with position 2 $\ne$ I. $3!-2!=4$ ways.
Total $=4+4+4=\mathbf{12}$.