Math 2.0

example

Birthday problem

Example

Assume that each person has a birthday on one of 365365 days, and that each day is equally likely. Assume also that the birthdays of different people are independent. Let p(n)p(n) be the probability that among nn people, at least two have the same birthday. By the rule for the complement, for 1≤n≤3651 \le n \le 365, p(n)=1−365⋅364⋯(365−n+1)365n.p(n) = 1 - \frac{365 \cdot 364 \cdots (365 - n + 1)}{365^n}. Then p(22)≈0.476p(22) \approx 0.476 and p(23)≈0.507p(23) \approx 0.507. So 2323 people are enough for a probability above 1/21/2.

Remarks

The answer is surprising because there are many pairs: 2323 people form (232)=253\binom{23}{2} = 253 pairs. For nn much smaller than 365365, p(n)≈1−e−n(n−1)/730p(n) \approx 1 - e^{-n(n-1)/730}. For n=70n = 70, p(n)>0.999p(n) > 0.999. For n≥366n \ge 366, p(n)=1p(n) = 1 by the pigeonhole principle.

Explanations

L1 human

It is easier to compute the chance that all birthdays are different. The second person must avoid 11 day, the third person must avoid 22 days, and so on. These small losses multiply quickly.

What this node needs for W1
  • edge instance_of or not_instance_of or illustrates out (0 of 1)

The writing levels say how complete the text of a node is. They do not measure its truth.

Sources

  1. Web https://en.wikipedia.org/wiki/Birthday_problem, Calculating the probability