birthday problem
- Also called:
- birthday paradox
- Related Topics:
- probability theory
- birthday
- problem
birthday problem, question in probability theory that asks in a group containing a given number of n people, what is the probability that at least one pair of people share the same birthday. The problem is famous for its counterintuitive outcomes, as only a small number of people are needed for there to be a probable chance of a shared birthday—in a group of 23 people, there is an approximately 50 percent chance that two people will share a birthday. Although there is debate over who came up with the original birthday problem, a version was first published by Austrian mathematician Richard von Mises in 1939.
The birthday problem can be phrased in a variety of ways. In its most general form, it can be stated, “What is the probability that, in a group of n people, two of them share the same birthday?” The question can also be phrased with a specific probability in mind, often 50 percent, and ask the number of people that would be needed for there to reach that level of chance. “How many people would need to be in a room for there to be a 50 percent chance that at least two of them share the same birthday?”
The solution for the birthday problem, denoted as P(A), starts by considering the opposite outcome, P(not A). As complementary probabilities, 1 − P(not A) = P(A). Subtracting the solution’s opposite outcome—that everyone in the room has a unique birthday—from 1 provides the probability that at least two people share the same birthday. To maintain all unique birthdays in P(not A), the first person in the group can have any one of the 365 birthdays (365/365), the second person can have any one of the remaining 364 days (364/365), the third person can have any one of the remaining 363 days (363/365), and so on, assuming that birthdays are uniformly distributed, and leap years are excluded. The remaining members of the group would follow the same pattern all the way to the nth person, whose birthday could be on any of the remaining 365 – n + 1 days. When multiplied together, these values represent the probability of every member in the group having unique birthdays.P(A) = 1 − P(not A)P(A) = 1 − (365/365 ⨉ 364/365 ⨉ 363/365 ⨉ … ⨉ 365 − n + 1/365The formula can be simplified into the expression below, with the numerator representing the total number of combinations of unique birthdays that could occur, while the denominator of 365n represents the total number of possible birthday combinations among n people.P(A) = 1 − (365 ⨉ 364 ⨉ 363 ⨉ … ⨉ (365 -n + 1)/365nOne can use factorials (that is, n! = 1 ⨉ 2 ⨉ 3 ⨉ … ⨉ n) to simplify the formula, as the numerator is equivalent to 365!/(365 − n)!P(A) = 1 − (365!/365n(365 − n)!
Substituting different values of n reveals that the approximate likelihood of at least two people sharing a birthday in a group of that size. The probability obviously reaches certainty when 366 or more people are in the room. But contrary to intuition, high probabilities are reached with relatively small numbers of individuals. In a group of n = 23 people, the probability equals 50.7 percent, and increasing the value to just n = 57 people leads to a probability of approximately 99 percent—an almost sure chance that at least two people were born on the same date.
The birthday problem is called a paradox, because the number of people required for a high likelihood of birthday overlap seems so low. One might think that surely the number must be 183, since that is more than half of the days in a year, but this plays into a common misconception that the birthday problem considers the number of people who specifically share the solver’s birthday, not just any pair of shared birthdays among the group. The misconception involves forgetting that everyone else in the room could share a birthday.
Take a room with 23 people in it. The first person has a possible 22 people they can pair with. The second person has 21 possible birthday pairs to test. (The second person has already been checked with the first person.) The sum of possible birthday pairs among 23 people is 22 + 21 + … + 2 + 1 = 253.
This misconception is related to the birthmate problem: “How many people would one need to ask for there to be a 50 percent chance that someone shares one’s birthday?” This birthmate problem has a considerably higher answer (253 people are needed to be asked for a 50 percent chance of someone having the same birthday as the solver) due to replacement in the sample. Unlike the birthday problem, those being asked in the birthmate problem do not need to have unique birthdays from one another—only from the solver. Others in the crowd can have overlapping birthdays amongst themselves, leading to the need for more than 183 people to reach a more than 50 percent chance of finding someone with an exact matching birthday. Since there are 253 possible pairs in a group in which there is a 50 percent chance of matching any birthday, by the same intuition, one needs 253 people to have a 50 percent chance of a pair with one specific birthday. Solutions to the birthmate problem can be calculated by the formula below using n as a given number of people.P(A) = 1 − (364/365)n
The birthday problem is a simplification of real-world conditions. A lack of uniformity in birthday distribution complicates the true calculation, as children are more likely to be born on some dates than others. In the United States more children are born in the summer months. While this nonuniformity makes shared birthdays even more likely within a group, the inclusion of leap years reduces such a probability. However, scholars have calculated that the differences caused by these considerations are negligible.