Five balls are arranged around a circle. Chris chooses two adjacent balls at random and interchanges them. Then Silva does the same, with her choice of adjacent balls to interchange being independent of Chris's. What is the expected number of balls that occupy their original positions after these two successive transpositions?
- A)
- B)
- C)
- D)
- E)
Answer
D
Key insight
By linearity, the answer is 5 times the chance one fixed ball ends home: untouched twice (3/5 * 3/5) or swapped away and swapped straight back (2/5 * 1/5).
Solution
There are adjacent pairs, and each person picks one uniformly, so there are equally likely (Chris, Silva) choices.
By linearity of expectation, the expected number of balls in their original spots is times the probability that one particular ball, say ball , ends up where it started. Ball belongs to of the adjacent pairs.
- Chris does not touch (probability ) and Silva does not touch (probability ): never moves. Probability .
- Chris swaps a pair containing (probability ), moving one spot over. returns only if Silva swaps that same pair (probability ); any other choice leaves displaced or pushes it further. Probability .
- Chris does not touch but Silva does: ends displaced.
So , and the expected count is
The answer is .
Why this works
Linearity of expectation lets you ignore the dependence between balls: compute one ball's probability of ending home and multiply by five. Symmetry (every ball sees the same situation) makes that one probability enough. This "indicator per object" trick is the standard route for any "expected number of fixed points" question.
Alternative approach
Enumerate the outcomes directly: have Silva undo Chris (all balls fixed), have the pairs overlapping in one ball (a -cycle; fixed), and have disjoint pairs ( fixed). Total , average .
The trap
Counting only the case where neither swap touches the ball (9/25) and forgetting the swap-and-swap-back case, giving 1.8.
Common mistakes
- Counting only the case where neither swap touches the ball (9/25) and forgetting the swap-and-swap-back case, giving 1.8.
- Believing Silva can also return by swapping the other pair containing 's new position; that moves two spots away, not home.
Techniques
Split into exhaustive cases and handle each · Exploit symmetry to reduce work or pair up objects