|
|
|
|
birthday problem
|
(Definition)
|
|
|
The birthday problem is: What is the probability of two or more people out of a group of $n$ do have the same birthday?
Solution. Let $A$ be the event two or more people out of a group of $n$ to have the same birthday. It is easy to find first the complement of $A$ $A^c$ which is that no two people out of a group of $n$ will have matching birthdays out of $365$ (number of days of one year) equally possible birthdays. We start with an arbitrary
person's birthday. So the second person's birthday in order to be different from the first one gives us the probability, $1-\frac{1}{365}$ Consecutively, the third person's birthday is different from the first two and we have $(1-\frac{1}{365})(1-\frac{2}{365})$ Finally for the the $n$ person's birthday we get the probability
| $\displaystyle P[A^c]$ |
$\displaystyle =\left(1-\frac{1}{365}\right)\left(1-\frac{2}{365}\right)\dots\left(1-\frac{n-1}{365}\right)$ |
By the last expression of the estimated probability we can see that there exists another easier approach to find the probability which is the following:
- We set the possible ways for $1\dots n$ birthdays, $365^n$ as the denominator.
- Using the binomial coefficient ${365\choose n}$ which represents the number of ways of picking $n$ unordered birthdays from $365$ days multiplied by the factorial $n!$ used for the number of orders, in that way we determine the numerator.
Therefore we have $$P[A^c]={365\choose n}\frac{n!}{365^n}$$ whence $$P[A]=1-P[A^c]=1-{365\choose n}\frac{n!}{365^n}.$$
The table below shows the probability $P[A]$ for some values of $n$
| $n$ |
$P[A]$ |
| $10$ |
$0,11695$ |
| $20$ |
$0,41144$ |
| $23$ |
$0,50730$ |
| $30$ |
$0,70632$ |
| $40$ |
$0,89123$ |
| $50$ |
$0,97037$ |
|
"birthday problem" is owned by PrimeFan. [ full author list (2) | owner history (7) ]
|
|
(view preamble | get metadata)
| Other names: |
birthday paradox |
|
|
Cross-references: numerator, factorial, represents, binomial coefficient, denominator, expression, order, number, matching, complement, group, event
There are 2 references to this entry.
This is version 13 of birthday problem, born on 2006-08-11, modified 2007-11-18.
Object id is 8242, canonical name is BirthdayProblem.
Accessed 9822 times total.
Classification:
| AMS MSC: | 60-00 (Probability theory and stochastic processes :: General reference works ) | | | 05A10 (Combinatorics :: Enumerative combinatorics :: Factorials, binomial coefficients, combinatorial functions) | | | 60C05 (Probability theory and stochastic processes :: Combinatorial probability) |
|
|
|
|
|
|
Pending Errata and Addenda
|
|
|
|
|
|
|
|
|
|
|
