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
Find the chance one ball ends at home, then multiply by 5. It is home if no swap touches it, or it is swapped away and straight back.
Solution
Each person picks one of the pairs of neighboring balls, so there are equally likely outcomes.
Idea. The expected number of balls at home equals the sum, over all five balls, of the chance that each one ends at home. Every ball is in the same situation, so find the chance for one ball and multiply by .
1. Pick one ball, call it . It belongs to of the neighbor pairs (the pair with its left neighbor and the pair with its right neighbor).
2. Case 1: nobody touches . Chris avoids with chance , and Silva avoids with chance . Chance .
3. Case 2: Chris moves , Silva moves it back. Chris picks a pair containing with chance . Now is one spot away. The only way it gets home is if Silva swaps that exact same pair, chance . Chance .
4. Any other outcome leaves away from home. (If Chris leaves alone but Silva moves it, it ends one spot away. If Chris moves it and Silva picks a different pair, it either stays moved or gets pushed farther.)
5. Chance is home: .
6. Expected number at home:
The answer is .
Why this works
To find the expected number of things that end up a certain way, add up each thing's chance. This works even though the balls affect each other, which is what makes it so useful. When all the things are in the same position, like five balls around a circle, you only need to work out one chance and multiply.
Alternative approach
Sort the outcomes by how Silva's pair relates to Chris's pair.
| Silva's pair | outcomes | balls at home | total |
|---|---|---|---|
| same as Chris's (undoes it) | |||
| shares one ball with Chris's | |||
| shares no ball with Chris's |
Adding up, balls at home over outcomes, an average of .
The trap
Counting only the case where neither swap touches the ball (9/25) and forgetting the swap-and-swap-back case, which gives 1.8.
Concise 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 .
Review in the AoPS books
- Introduction to Counting & Probability, Chapter 11: Expected Value
- Introduction to Counting & Probability, Chapter 7: Introduction to Probability
- Introduction to Algebra, Chapter 22: Special Manipulations (§22.3)
- Introduction to Counting & Probability, Chapter 2: Basic Counting Techniques (§2.2)
Techniques
Split into exhaustive cases and handle each · Exploit symmetry to reduce work or pair up objects