Birthday problem
Example
Assume that each person has a birthday on one of days, and that each day is equally likely. Assume also that the birthdays of different people are independent. Let be the probability that among people, at least two have the same birthday. By the rule for the complement, for , Then and . So people are enough for a probability above .
Remarks
The answer is surprising because there are many pairs: people form pairs. For much smaller than , . For , . For , by the pigeonhole principle.
Explanations
L1 human
It is easier to compute the chance that all birthdays are different. The second person must avoid day, the third person must avoid 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
- Web https://en.wikipedia.org/wiki/Birthday_problem, Calculating the probability
What links here
No node links to this node yet.