Expected Draws to First Ace
A standard 52-card deck is shuffled uniformly at random. You draw cards one at a time from the top, without replacement.
What is the expected number of cards you must draw until you see the first Ace (including the Ace itself)?
Hints
- Think about how the 4 Aces partition the deck into gaps. What can symmetry tell you about these gaps?
- By symmetry of random permutations, the 48 non-Aces are uniformly distributed across the $m+1 = 5$ gaps created by the Aces.
- Each gap gets $48/5 = 9.6$ non-Aces on average, so the first Ace is at position $9.6 + 1 = 10.6$. More generally, the first of $m$ specials among $n$ items sits at position $(n+1)/(m+1)$.
Worked Solution
How to Think About It: Before touching any formulas, think about it from a symmetry angle. There are 4 Aces and 48 non-Aces. The 4 Aces split the deck into 5 "gaps" -- before the first Ace, between Aces 1 and 2, between Aces 2 and 3, between Aces 3 and 4, and after the last Ace. By symmetry of random shuffles, each gap gets the same expected share of the 48 non-Aces. That is the whole insight.
Quick Estimate: Each of the 5 gaps gets $48/5 = 9.6$ non-Aces on average. The first Ace sits right after the first gap. So you draw 9.6 non-Aces, then the Ace itself, for $9.6 + 1 = 10.6$ draws. Done.
As a sanity check: if there were only 1 Ace in 52 cards, the expected position would be $(52+1)/2 = 26.5$ by symmetry (any of the 52 slots equally likely). With 4 Aces, we expect the first one much sooner, and $10.6$ feels right -- roughly $52/5$.
Approach: We use the general formula for the expected position of the first "special" item in a random permutation.
Formal Solution:
Label the 4 Aces as "special" among $n = 52$ total cards with $m = 4$ specials. By symmetry, the $m$ special items divide the deck into $m + 1$ equally-likely gap patterns. The expected number of non-specials before the first special is:
$$E[\text{non-specials before first special}] = \frac{n - m}{m + 1} = \frac{48}{5} = 9.6$$
So the expected position (draw number) of the first special item is:
$$E[\text{position of first special}] = \frac{n - m}{m + 1} + 1 = \frac{n + 1}{m + 1}$$
Alternatively, here is a direct proof. Consider any of the 52 positions. The probability the first Ace is at position $k$ (for $k = 1, 2, \ldots, 49$) is:
$$P(\text{first Ace at } k) = \frac{\binom{48}{k-1}}{\binom{52}{k-1}} \cdot \frac{4}{52 - k + 1}$$
where the first factor is the probability that positions $1$ through $k-1$ are all non-Aces, and the second factor is the probability position $k$ is an Ace given the remaining cards. Summing $k \cdot P(\text{first Ace at } k)$ yields the same result, but the symmetry argument is cleaner.
Plugging in $n = 52$, $m = 4$:
$$E = \frac{52 + 1}{4 + 1} = \frac{53}{5} = 10.6$$
Answer: The expected number of draws to the first Ace is $\frac{53}{5} = 10.6$.
Intuition
This problem is a clean application of the "stars and bars via symmetry" idea for order statistics in random permutations. When you have $m$ special items among $n$ total, the specials act like dividers that chop the sequence into $m+1$ segments. Because every permutation is equally likely, these segments have equal expected length -- no slot is "special" by position. So the expected gap size is $(n - m)/(m+1)$, and the expected position of the $j$-th special item is $j(n+1)/(m+1)$.
This pattern appears constantly in quant interviews and in practice. Coupon-collector variants, first-hit problems, and even some order-book questions reduce to the same symmetry. The key lesson: whenever you see "expected position of the first occurrence" in a random arrangement, reach for the $(n+1)/(m+1)$ formula before setting up any sums. It is the fastest path to the answer and immediately signals to an interviewer that you know how to exploit symmetry.