Birthday Paradox Calculator
In a group of just 23 people, there's a 50% chance two of them share a birthday. See how the odds change with group size.
How this is calculated
The probability that everyone in the group has a different birthday shrinks with every extra person added, since each new person has one fewer "free" day to pick from out of 365. Multiplying those shrinking odds together gives the probability that nobody shares a birthday — and one minus that is the probability that at least two people do.
This same "any pair, not a specific pair" effect shows up in cryptography as the birthday attack. If a hash function produces an n-bit output, finding an input that hashes to one specific target value takes roughly 2ⁿ attempts on average — but finding any two inputs that hash to the same value (a collision) takes only about 2^(n/2) attempts, the same square-root speedup that makes 23 people enough for a 50/50 birthday match instead of 183. This is exactly why cryptographic hash functions need outputs roughly twice as long as the "brute force" security level would naively suggest — a 128-bit collision-resistant hash needs 256 bits of output. For another probability calculation grounded in real-world evidence rather than pure combinatorics, see the Bayes' Theorem calculator.
Frequently asked questions
- Why is it called a "paradox"?
- It's not a logical paradox, just wildly counterintuitive: most people guess you'd need close to 183 people (half of 365) for a 50/50 chance. The real answer is 23 — because you're comparing every pair of people, not just one person against everyone else, and the number of pairs grows much faster than the number of people.
- Why does the number of pairs matter so much?
- With 23 people there are 253 possible pairs (23 × 22 / 2). Each pair only needs a 1-in-365 chance of matching, but with 253 independent chances to get a match, the odds of at least one hit climb fast — that's the whole trick behind the paradox.
- Does this account for leap years?
- No — it uses the standard simplification of 365 equally likely birthdays and ignores February 29th, which is the conventional way this problem is presented and has a negligible effect on the result.
- Can I use this in my own app?
- Yes — every calculator on Stupidly Clever has a matching REST API and MCP tool that runs the same underlying logic.
- Why does the birthday paradox feel counterintuitive?
- Most people instinctively compare their own birthday against everyone else's, which would indeed need close to 183 people for even odds. But the actual question is whether ANY two people out of the whole group share a birthday — and the number of pairs to check grows much faster than the number of people, which is what makes the true answer (23) feel surprisingly low.
- What probability triggers the 50% threshold?
- At 23 people, the probability of at least one shared birthday crosses 50% (technically about 50.7%) — the point where a shared birthday becomes more likely than not.
- How many people are needed for a >99% chance of a shared birthday?
- Around 57 people gives roughly a 99% probability that at least two share a birthday — far fewer than the 366 you'd need to guarantee it, illustrating just how quickly the pairwise-comparison effect compounds.
- What real-world cryptography problem does the birthday paradox illustrate?
- It underlies the "birthday attack" against hash functions — finding any two inputs that produce the same hash output requires far fewer attempts than finding a specific input that matches a given hash, for exactly the same combinatorial reason a shared birthday is easier to find than a match to your own.