Understanding the problem took some time. We have 5 boxes, different color so basically all boxes are different, none are identical.
Let the boxes be: B1, B2, B3, B4, B5
And their respective lids be: L1, L2, L3, L4, L5
The lids of all boxes are removed. We need to find the probability that exactly two boxes had matching lids.
The problem can be seen as, In how many ways can you assign ONLY 2 boxes their respective lids such that those two boxes get their respective lids, but all the others DO NOT
For ex, one possibility is B1 gets L1 and B2 gets L2 (both B1 and B2 get their respective lid), but B3 gets L4, B4 gets L5 and B5 gets L3
You’re arranging the lids, from L1 to L5 on top of boxes, from B1 to B5
Total number of ways to arrange the lids: 5! (5 boxes, 5 lids) = 120
Number of ways to correctly assign only two lids and incorrectly assign the remaining three lids:
- First, select those two lids in 5C2 = 10 ways
- Now, these two lids can only be arranged in 1 way, since each lid needs to be placed on top of it’s respective box
- We now need to arrange or basically “de-arrange” the remaining 3 lids on 3 boxes such that none of the lids are placed on top of their respective boxes
- The only possible scenarios are:
- L4, L5, L3
- L5, L3, L4
- Hence there are two ways to de-arrange the remaining three lids
- Total number of ways to assign two lids correctly and the remaining incorrectly: 10x2 = 20
Probability: 20/120 = 1/6 (B)
Here's a little 2 min concept notes on "de-arrangement":
- A derangement is a permutation where no element stays in its original position.
- For example, if we have items A, B, C:
- One possible permutation: C, A, B
- If none of A, B, or C are in their original positions, it's a derangement.
There's also a complicated recursive formula for arrangements, but I don't think we'll need that in GMAT. Instead the given table should be more than enough. I'd memorise the values till n=4 or n=5 but not beyond that:
n Dₙ
1 0
2 1
3 2
4 9
5 44
6 265
7 1854
8 14833
9 133496
10 1334961
The above table shows the number of ways to de-arrange n different objects given by Dₙ