The First Ace
Shuffle an ordinary deck of 52 playing cards containing four aces. Turn up cards from the top one at a time until the first ace appears.
On average, how many cards must you turn up to get the first ace?
(Include the ace itself in the count.)
Answer: The First Ace
Key Idea / Intuition
Rather than computing a messy sum over geometric-like probabilities, use a beautiful symmetry argument: the 4 aces and 48 non-aces divide the deck into 5 gaps. By symmetry, each gap has the same expected size. The cards before the first ace form one of these five gaps, so on average there are non-ace cards before the first ace — plus the ace itself gives .
Formal Proof / Solution
Setup. Place 52 cards in a random order. The 4 aces land in 4 of the 52 positions, splitting the deck into 5 segments:
Symmetry argument. The 48 non-ace cards are distributed among 5 gaps (before ace 1, between aces 1–2, 2–3, 3–4, and after ace 4). By symmetry — since all placements of the four aces are equally likely — each gap has the same expected number of non-ace cards:
Answer. The number of cards turned up to reach the first ace equals:
Sanity check via direct formula. Let be the position of the first ace. Then:
where ... this sum is messy. The symmetry argument gives the answer in one line — that's what makes it beautiful.
General formula. For a deck of cards with aces:
Here: . ✓
This formula has a clean combinatorial proof: by symmetry, the aces divide cards into equally-treated gaps, and the expected position of the first ace is .
Source: Fifty Challenging Problems in Probability with Solutions, Frederick Mosteller, Problem 40