๐Ÿงฎ Brain Teaser

The Sock Drawer Surprise

A drawer contains rr red socks and bb blue socks. You draw socks one at a time, without replacement, until you get a matching pair (two of the same color).

What is the probability that the first matching pair is red?

(Assume rโ‰ฅ2r \geq 2 and bโ‰ฅ1b \geq 1.)

Hint: Think about what configuration of the first three draws forces a red match first.

combinatorial probabilitywithout replacementpigeonholematching pairs

Answer: The Sock Drawer Surprise

Key Idea / Intuition

A matching pair appears on the third draw at the latest โ€” by the pigeonhole principle, any three socks from two colors must contain two of the same color. So the game ends on draw 2 or draw 3. The first matching pair is red if and only if the third sock (when the game reaches draw 3) is red โ€” but more cleanly, the answer reduces to a simple symmetry argument about the first three socks drawn.

The key insight: focus only on the first three socks drawn. A red match comes first if and only if among these three socks, draws 1 and 2 are not a matching pair (so draw 1 and 2 are different colors, one red one blue), and draw 3 matches draw 1 or 2 to make a red pair. But even cleaner: the game ends on draw 3 exactly when draws 1 and 2 differ, and then the third sock's color determines which color matches first.


Formal Proof / Solution

Step 1: When does the game end?

  • If draw 1 and draw 2 have the same color, the game ends on draw 2.
  • If draw 1 and draw 2 have different colors, the game ends on draw 3 (draw 3 must match one of the first two).

Step 2: Probability of a red match on draw 2.

P(redย matchย onย drawย 2)=rr+bโ‹…rโˆ’1r+bโˆ’1P(\text{red match on draw 2}) = \frac{r}{r+b} \cdot \frac{r-1}{r+b-1}

Step 3: Probability of a red match on draw 3.

This requires: draws 1,2 are different colors (one red, one blue), and draw 3 is red.

There are two orderings for "different colors" in draws 1โ€“2: (Red, Blue) or (Blue, Red).

P(RBR)=rr+bโ‹…br+bโˆ’1โ‹…rโˆ’1r+bโˆ’2P(\text{RBR}) = \frac{r}{r+b}\cdot\frac{b}{r+b-1}\cdot\frac{r-1}{r+b-2}

P(BRR)=br+bโ‹…rr+bโˆ’1โ‹…rโˆ’1r+bโˆ’2P(\text{BRR}) = \frac{b}{r+b}\cdot\frac{r}{r+b-1}\cdot\frac{r-1}{r+b-2}

So: P(redย matchย onย drawย 3)=rโ‹…bโ‹…(rโˆ’1)+bโ‹…rโ‹…(rโˆ’1)(r+b)(r+bโˆ’1)(r+bโˆ’2)=2rb(rโˆ’1)(r+b)(r+bโˆ’1)(r+bโˆ’2)P(\text{red match on draw 3}) = \frac{r \cdot b \cdot (r-1) + b \cdot r \cdot (r-1)}{(r+b)(r+b-1)(r+b-2)} = \frac{2rb(r-1)}{(r+b)(r+b-1)(r+b-2)}

Step 4: Total probability of first match being red.

P(firstย matchย isย red)=r(rโˆ’1)(r+b)(r+bโˆ’1)+2rb(rโˆ’1)(r+b)(r+bโˆ’1)(r+bโˆ’2)\boxed{P(\text{first match is red}) = \frac{r(r-1)}{(r+b)(r+b-1)} + \frac{2rb(r-1)}{(r+b)(r+b-1)(r+b-2)}}

Factor out r(rโˆ’1)(r+b)(r+bโˆ’1)\dfrac{r(r-1)}{(r+b)(r+b-1)}:

=r(rโˆ’1)(r+b)(r+bโˆ’1)(1+2br+bโˆ’2)=r(rโˆ’1)(r+b)(r+bโˆ’1)โ‹…r+bโˆ’2+2br+bโˆ’2= \frac{r(r-1)}{(r+b)(r+b-1)}\left(1 + \frac{2b}{r+b-2}\right) = \frac{r(r-1)}{(r+b)(r+b-1)}\cdot\frac{r+b-2+2b}{r+b-2}

=r(rโˆ’1)(r+3bโˆ’2)(r+b)(r+bโˆ’1)(r+bโˆ’2)= \frac{r(r-1)(r+3b-2)}{(r+b)(r+b-1)(r+b-2)}

Step 5: Sanity check with symmetry.

Let r=b=2r = b = 2. Then total socks = 4.

P(redย first)=2โ‹…1โ‹…(2+6โˆ’2)4โ‹…3โ‹…2=2โ‹…624=1224=12.P(\text{red first}) = \frac{2 \cdot 1 \cdot (2 + 6 - 2)}{4 \cdot 3 \cdot 2} = \frac{2 \cdot 6}{24} = \frac{12}{24} = \frac{1}{2}.

By symmetry (r=br = b), the answer must be 12\tfrac{1}{2}. โœ“

The beautiful surprise: The answer does not simplify to just r/(r+b)r/(r+b) โ€” the probability of a red match first is not simply proportional to rr. The geometry of "first matching pair" introduces an asymmetry that favors the more numerous color more strongly than a naive guess suggests. For example, with r=3,b=1r=3, b=1:

P=3โ‹…2โ‹…(3+3โˆ’2)4โ‹…3โ‹…2=6โ‹…424=2424=1,P = \frac{3 \cdot 2 \cdot (3+3-2)}{4 \cdot 3 \cdot 2} = \frac{6 \cdot 4}{24} = \frac{24}{24} = 1,

which makes sense: with only 1 blue sock, you can never get a blue matching pair!

Source: Fifty Challenging Problems in Probability with Solutions (Frederick Mosteller)

Type: ProbabilitySource: Fifty Challenging Problems in Probability with Solutions (Frederick Mosteller)Edit on GitHub โ†—