The Shared Birthday Secretary
There are people in a room. Each person independently and uniformly selects a birthday from . You interview them one by one, learning each person's birthday as you go.
Question: What is the expected number of people you must interview until you find the first person who shares a birthday with someone you've already interviewed (i.e., the first "collision")?
For concreteness, find a clean closed form in terms of and compare to your intuition from the birthday paradox.
Answer: The Shared Birthday Secretary
Key Idea / Intuition
The birthday paradox tells us there's about a 50% chance of a collision among just 23 people — far fewer than the 183 one might naively expect. The expected number of interviews until the first collision captures the same phenomenon algebraically. At step , the probability that the -th person is new (no collision yet) is , so we can compute the expected stopping time by summing the probability of "no collision in the first people" over all .
The key trick is: , which is a standard tail-sum formula for expectations.
Formal Proof / Solution
Let be the number of people interviewed until the first collision (including the person who causes the collision). We want .
Tail-sum formula. For any non-negative integer-valued random variable,
Now is the probability that the first people all have distinct birthdays (so no collision has happened yet after interviews):
Setting for brevity:
(The sum terminates at because after interviewing people a collision is guaranteed by pigeonhole.)
Numerical value. Computing this sum for :
Approximate closed form. Since for large , we approximate the sum by an integral:
For :
The surprise. You only need to interview about people on average — roughly rather than . This is the birthday paradox in quantitative form: collisions happen shockingly early because the number of pairs grows as , and a collision becomes likely once , i.e., .
Summary table:
| Quantity | Value () | |---|---| | Naive guess | | | Expected interviews to first collision | | | Approximation | |
Written to: questions/2026-06-17_pm.md Answer: questions/2026-06-17_pm_answer.md
Source: Fifty Challenging Problems in Probability with Solutions (Mosteller) — inspired by birthday-type problems; classical folklore