Back to Blog

The Birthday Problem

You're at a party with 22 other people: 23 total, including you. Someone makes a bet: "I'll wager that at least two people here share a birthday."

Would you take that bet?

Most people would. After all, there are 365 days in a year. With only 23 people, surely the chances of a match are tiny. Maybe 5%? 10% at most?

Here's the thing: you'd lose that bet more often than you'd win it.

With just 23 people in a room, the probability of at least two sharing a birthday is over 50%. And by the time you hit 70 people, it's virtually certain: 99.9%.

If this feels wrong, you're not alone. The birthday problem trips up almost everyone. Let's figure out why our intuition fails and build a better one.

The Wrong Question

Here's where most people go wrong. When they hear "birthday match," they think:

"What's the chance that someone shares my birthday?"

That's a reasonable question, but it's the wrong one. With 22 other people, the chance that at least one shares your birthday is only about 6%. Your intuition is correct for that problem.

The Problem

The actual question is: "What's the chance that any two people share a birthday?" This is a very different problem. We're not anchoring on one person: we're looking for matches anywhere in the group.

This shift in framing changes everything. Let's see why.

Counting the Pairs

The key insight is that we're not checking 22 potential matches. We're checking every possible pair of people.

How Pairs Multiply Watch the connections explode as people are added
12
People
2
New pairs
+1
Total pairs
1
Pairs = 2 × 1 / 2 = 1
Person 2 enters. They can pair with 1 existing person. Total pairs: 1
1 / 9

See how quickly the pairs multiply? With 23 people, there are 253 different pairs that could potentially match. Each pair is an independent opportunity for a birthday collision.

This is the crux of the birthday problem. Our brains think linearly: "23 people, 365 days, small chance." But the number of pairs grows quadratically. When you add a 24th person, you're not adding 1 more opportunity for a match: you're adding 23 more opportunities (one with each existing person).

Key Insight

The formula for counting pairs is C(n,2) = n(n-1)/2. With 23 people: 23 × 22 / 2 = 253 pairs. That's 253 chances for a match, not 23.

Building Up the Probability

Let's build the probability step by step, watching what happens as each person enters the room.

Building the Probability Watch the match probability grow with each person
1
Probability of match0.0%
50%
First person enters. No one to match with yet.
1 / 30

Notice what's happening.

First person: No one to match with. Probability of a match so far: 0%.

Second person: One pair to check. They have a 1/365 chance of matching the first person. Probability of no match: 364/365, about 99.7%.

Third person: Two new pairs to check (with person 1 and person 2). But here's the key: we're not just adding to the probability. We're multiplying the survival probabilities. The third person must avoid both existing birthdays.

And so on. Each new person must avoid all existing birthdays. The probability of no match keeps shrinking.

The formula for no match with k people is:

P(no match) = (365/365) × (364/365) × (363/365) × ... × ((366-k)/365)

Each factor is slightly less than 1. Multiply enough of them together, and you get something surprisingly small.

The Crossover Point

Drag the slider to see how probability changes with group size.

The Probability Curve Adjust the group size and watch the probability climb
23
123 (50%)70
Probability of at least one match
50.7%
100%50%0%010235070
Key milestones
10 people
11.7%
23 people(50% crossover)
50.7%
50 people
97.0%
70 people
99.9%
Notice: At 23 people, a birthday match is more likely than not.

The crossover happens at 23 people: that's where the probability tips past 50%. Look at how steep the curve gets after that. By 50 people, you're at 97%. By 70, it's 99.9%.

Birthday matches aren't rare. They're common.

Why Our Intuition Fails

The birthday problem exposes how we underestimate combinatorial explosion.

When we think about 23 people, we imagine 23 things. But the number of pairs of 23 things is much larger: 253. And our brains don't naturally jump to "pairs" when we hear the problem.

This same pattern shows up in cryptography, where "collision attacks" exploit birthday math to break hashes faster than brute force. It appears in network design too: n computers can form n(n-1)/2 connections, which is why large networks get complicated fast.

The birthday problem isn't just a party trick. It's a reminder that our intuitions about probability fail badly when combinations are involved.

The Real Lesson

The birthday problem is really about framing. The question we think we're answering often isn't the question we should be answering.

When someone says "What are the odds?", I check: What exactly is the event we're measuring? How many ways can that event occur? Are there hidden combinations we're not counting?

In the birthday problem, the hidden combinations were the pairs. In other probability puzzles, they might be something else. But the pattern is the same: count carefully before you trust your gut.

Key Insight

The birthday problem probability for k people: P(match) = 1 - (365!/((365-k)! × 365^k)). The key is that we're calculating 1 minus the probability of NO match, because it's easier to compute the "everyone has a unique birthday" case.

So: 23 people, 253 pairs, better than 50% odds of a match. The next time someone offers you that party bet, you'll know which side to take.