๐Ÿงฎ Brain Teaser

The Collector's Last Coupon โ€” A Waiting Time Surprise

You have a fair, well-shuffled deck of 2n2n cards: exactly nn red cards and nn black cards. You flip cards one at a time until you have seen at least one card of each color.

Question: What is the expected number of cards you must flip?

(For concreteness, try n=1n = 1 and n=2n = 2 first to build intuition.)

order statisticswaiting timesymmetrycombinatoricswithout replacement

Answer: The Collector's Last Coupon

Key Idea / Intuition

The game ends the moment the second color appears for the first time โ€” equivalently, it ends at the flip that breaks the initial "all one color" run. The first card is always some color. We then wait until the first card of the opposite color appears. By symmetry, what matters is only the position of the first card of the minority color among a deck of 2n2n cards. This turns into a clean question about the position of a specific card type in a random ordering.


Formal Proof / Solution

Setup. After flipping the first card (say it's red, by symmetry the argument is identical for black), we need the first black card among the remaining 2nโˆ’12n - 1 cards, of which exactly nn are black.

Key observation. Consider the positions of the nn black cards among the remaining 2nโˆ’12n-1 slots. By symmetry, the first black card is equally likely to be in any of the 2nโˆ’12n-1 positions โ€” but that's not quite right. We need the minimum order statistic of nn uniform draws without replacement from {1,2,โ€ฆ,2nโˆ’1}\{1, 2, \ldots, 2n-1\}.

Expected position of the first black card. If we pick nn items uniformly at random (without replacement) from {1,2,โ€ฆ,2nโˆ’1}\{1, 2, \ldots, 2n-1\}, the expected value of the minimum is:

E[minโก]=2nโˆ’1+1n+1=2nn+1.\mathbb{E}[\min] = \frac{2n - 1 + 1}{n + 1} = \frac{2n}{n+1}.

This uses the standard result: for the minimum of nn items chosen without replacement from {1,โ€ฆ,N}\{1, \ldots, N\},

E[min]=N+1n+1.\mathbb{E}[\text{min}] = \frac{N+1}{n+1}.

Here N=2nโˆ’1N = 2n-1, so E[min]=2nn+1\mathbb{E}[\text{min}] = \frac{2n}{n+1}.

Total expected flips. We flip the first card (1 flip always), then wait E[min]\mathbb{E}[\text{min}] more flips to see the first opposite-color card:

E[total]=1+2nn+1=n+1+2nn+1=3n+1n+1.\mathbb{E}[\text{total}] = 1 + \frac{2n}{n+1} = \frac{n+1+2n}{n+1} = \frac{3n+1}{n+1}.

Sanity checks:

  • n=1n=1: deck has 1 red, 1 black. You always flip exactly 2 cards. Formula gives 42=2\frac{4}{2} = 2. โœ“

  • n=2n=2: deck has 2 red, 2 black. Formula gives 73โ‰ˆ2.33\frac{7}{3} \approx 2.33.

    Manual check: P(stop at flip 2) = P(second card differs from first) = 23\frac{2}{3}; P(stop at flip 3) = 13\frac{1}{3} (second card same, third must differ). E=2โ‹…23+3โ‹…13=73\mathbb{E} = 2 \cdot \frac{2}{3} + 3 \cdot \frac{1}{3} = \frac{7}{3}. โœ“

The elegant formula:

E[cardsย flipped]=3n+1n+1\boxed{\mathbb{E}[\text{cards flipped}] = \frac{3n+1}{n+1}}

As nโ†’โˆžn \to \infty, this approaches 33 โ€” a beautiful limit saying that in a very large balanced deck, you expect to flip only about 3 cards before seeing both colors.

Why the limit is 3: In a huge deck, the probability the second card already differs from the first is โ‰ˆ1/2\approx 1/2. If not, the third card differs with probability โ‰ˆ1/2\approx 1/2, and so on. This geometric-like structure gives Eโ‰ˆ1+2=3\mathbb{E} \approx 1 + 2 = 3 via a geometric series argument (expectation of a geometric with p=1/2p=1/2, shifted).

Source: Folklore / classical probability; related to Mosteller's 'Fifty Challenging Problems in Probability'

Type: ProbabilitySource: Folklore / classical probability; related to Mosteller's 'Fifty Challenging Problems in Probability'Edit on GitHub โ†—