The GATE Grind

GATE 2020 CS – Question 52

Engineering Mathematics · Discrete Mathematics: Combinatorics (Counting, Recurrence Relations, Generating Functions) · 2 marks · Numerical answer

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.

Total $=4+4+4=\mathbf{12}$.

More Discrete Mathematics: Combinatorics (Counting, Recurrence Relations, Generating Functions) questions

All Discrete Mathematics: Combinatorics (Counting, Recurrence Relations, Generating Functions) questions →