Skip to content

The birthday problem

Unsolved Easy Archive

Assume birthdays are independent and uniformly distributed over 365 days. What is the smallest number of people for which the probability that at least two of them share a birthday exceeds 1/2?

Posed by Harold Davenport (attributed)
Like0
History and references

Solved in 1939 by Richard von Mises (first publication).

The problem is usually credited to Harold Davenport around 1927, who did not publish it, and the first published version is by Richard von Mises in 1939. The probability that people all have different birthdays is . For this is still above 1/2, and for it is about 0.4927, so a shared birthday has probability about 0.507 and the answer is 23. The number seems small because what matters is the number of pairs, and 23 people form 253 pairs. The same square-root effect governs collisions in hash functions.

References

Solutions 0

Nobody has posted a solution here yet. Solutions written on Problempedia are credited to the people who write them.

Discussion 0

Sign in to join the discussion