# Probability of 3 people in a room of 30 having the same birthday

I have been looking at the birthday problem (http://en.wikipedia.org/wiki/Birthday_problem) and I am trying to figure out what the probability of 3 people sharing a birthday in a room of 30 people is. (Instead of 2).

I thought I understood the problem but I guess not since I have no idea how to do it with 3.

• Do we completely disregard the fact that people are more likely to be born on certain months than others? Making this slightly more likely? – fdart17 Mar 9 '11 at 4:27
• @Fdart17: In Exercise 13.7 of The Cauchy-Schwarz Master Class, J. Michael Steele uses Schur convexity to show that uniform probabilities are least likely to give birthday matches. So you are right, non-uniform birthdays give us a better chance of a match. – user940 Mar 9 '11 at 16:32
• Does the problem get simpler if you only want the probability that at least three people have the smae birthday? Does anyone have a solution for this problem? – user59238 Jan 22 '13 at 15:54

The Poisson approximation is pretty good, though. Imagine checking every triple and calling it a "success" if all three have the same birthdays. The total number of successes is approximately Poisson with mean value ${30 \choose 3}/365^2$. Here $30\choose 3$ is the number of triples, and $1/365^2$ is the chance that any particular triple is a success. The probability of getting at least one success is obtained from the Poisson distribution: $$P(\mbox{ at least one triple birthday with 30 people})\approx 1-\exp(-{30 \choose 3}/365^2)=.0300.$$
You can modify this formula for other values, changing either 30 or 3. For instance, $$P(\mbox{ at least one triple birthday with 100 people})\approx 1-\exp(-{100 \choose 3}/365^2)=.7029,$$ $$P(\mbox{ at least one double birthday with 25 people })\approx 1-\exp(-{25 \choose 2}/365)=.5604.$$
• Empirically it seems the probability of at least one triple birthday with $100$ people is closer to $0.64$ or $0.65% than$0.70$– Henry Sep 6 '13 at 7:43 • Poisson approximation is good but your answer has a bug. You need to do 1 - u * exp(-u) instead of 1 - exp(-u). Remember Poisson distribution is P(k) = u * exp(-u) / k! Here we take k=1 as we are interested in finding just one pair. Making this change gives answer 0.6394, pretty close to true value. – ShitalShah Jul 26 '15 at 6:43 An exact formula can be found in Anirban DasGupta, The matching, birthday and the strong birthday problem: a contemporary review, Journal of Statistical Planning and Inference 130 (2005), 377-389. This paper claims that if$W$is the number of triplets of people having the same birthday,$m$is the number of days in the year, and$n$is the number of people, then $$P(W \ge 1) = 1 - \sum_{i=0}^{\lfloor n/2 \rfloor} {m! n! \over i! (n-2i)! (m-n+i)! 2^i m^n}$$ No derivation or source is given; I think the idea is that the term corresponding to$i$is the probability that there are$i$birthdays shared by 2 people each and$n-2i$birthdays with one person each. In particular, if$m = 365, n = 30$this formula gives$0.0285$, not far from Byron's approximation. • Here is a good approximation based on two Poissons - one that overcounts and one that undercounts: $$P(W=0)=\frac 1 2\left(\exp\left(-T\right)+\exp\left(-\frac T{1+\frac{3(n-3)}{2m}} \right)\right)$$ where$T=(\frac 1 m)^2\binom n 3$is expected number of triplets sharing a birthday and the second exponent is expected number of birth-days that are shared by at least$3$people. The principle of averaging probabilities of$P(T)$and$P(T/(1+\alpha))$can be extended to other events, not just$W=0$. Yields$\approx 0.028537$in this case. Change$3$to$M$for$M-plets$of birthdays. – A.S. Dec 13 '15 at 16:54 Since this question has been linked to a question concerning the generalization to the case of$M$people having the same birthday (Birthday paradox with M shared birthdays), I would like to add the general answer. Starting with the expression given by Michael Lugo (a derivation can be found here), it's rather easy to obtain the general solution. First, the expression can be simplified by using falling factorials: $$\displaystyle P(W\ge1) = 1 - \sum_{i=0}^{\lfloor n/2 \rfloor} \frac{(n)_{2i}(m)_{n-i}}{i! 2^i m^n}$$ where$(n)_k := n\cdot(n-1)\cdot\ldots\cdot(n-k+1)$. The$i$th term in the sum represents the probability of having$i$distinct pairs of people. To generalize this result we note that the number 2 is just the size of a pair and can be replaced by any larger group size. However, we must be careful, since the$2^i$in the denominator is really$(2!)^i$(see the derivation for details). Thus, if we want to know the probability that at least$M$people from a group of$n$share a common birthday, we sum over all group sizes smaller than$M$, replacing$2i$in the numerator by$ki$(where$k$is the summation index) and$2^i$in the denominator by$(k!)^i$: $$\displaystyle P(W\ge1) = 1 - \sum_{k=2}^{M-1}\sum_{i=0}^{\lfloor n/k \rfloor} \frac{(n)_{ki}(m)_{n-i}}{i! (k!)^i m^n}$$ As being pointed out by Micheal Lugo the formulation given by Anirban DasGupta is a exact answer for this problem, however a formal proof is needed. I have found and verified a solution by Doctor Rick from Math Forum, below is the link http://mathforum.org/library/drmath/view/56650.html His approach is to partition the sample space as following:  1. none share a birthday 2. one pair shares a birthday 3. two pairs share different birthdays 4. three pairs share different birthdays : 1+N/2. N/2 pairs share different birthdays 2+N/2. three or more share a birthday  Then he points out a clever way to count for each partition by picking different birthday for each pair of person. I have tried and arrived with the same formulation as Anirban DasGupta's. For more detail please take a look at the link above! • You know this question is 4 years old right – dalastboss Mar 11 '15 at 5:25 • I know, but just like me, someone will still look for the answer for it in future, and I think it hadn't got any good proof yet. I have verified that my proof is correct in my class! – minhta Mar 24 '15 at 16:42 • Yep, in 2015 still looking at this answer.. – Pieter21 Nov 24 '15 at 18:55 • August 2017 here! – goodeye Aug 2 '17 at 15:16 I'm a bit skeptical of this answer. Here is a formula that works. It probably helps to explain Dasgupta's formula from Michael Lugo's answer first. Say that a map$f : [m]\to [n]$is$k$-almost injective if$|f^{-1}(j)|\le k$for all$j\in [n]$. Counting injective maps is easy, there are $$I(1,m,n) := m!\binom{n}{m}$$ of them. You just pick the range and then a bijection to it. This gives right away the standard birthday collision probability for$m$people and years of length$n$$$1 - n^{-m}I(1,m,n)$$ One gets the generalized birthday probability from$I(k,m,n)$in the same way, so we can just think about$I(k,m,n)$. How would we go about counting$2$-injective maps? The same idea as before works. This time, we pick$c$pairs that will have colliding images, injectively map these into$[n]$, then injectively map the rest to a set of size$n-c$. So we get $$I(2,m,n) = \sum_{c=0}^{\lfloor m/2\rfloor}\frac{1}{c!} \left(\prod_{j=0}^{c-1}\binom{m - 2j}{2}\right) I(1,c,n)I(1,m-2c,n-c)$$ This is equivalent to Dasgupta's formula, but it is easier to see the induction. If we want to get$I(k,m,n)$in general, we have $$I(k,m,n) = \sum_{c=0}^{\lfloor m/k\rfloor}\frac{1}{c!} \left(\prod_{j=0}^{c-1}\binom{m - kj}{k}\right) I(1,c,n)I(k-1,m-kc,n-c)$$ My own research led to the following result... Knowing that there are$A$days in the year (typically$A=365$), the probability$P(A, M, n)$that at least$n$children have their birthday the same day within a class of$M$children is: $$\boxed{ P(A, M,n) = 1 - \dfrac{ K_n(A, M) }{ A^M } }$$ where$K_n(A, M)$represents the number of configurations in which one cannot find$n$children (or more) having their birthday the same day, and can be computed by recurrence as follows: $$\forall n\ge 2, \quad \boxed{ K_{n+1}(A, M) = \sum_{0\le k\le \left\lfloor{\frac{M}{n}}\right\rfloor} \dfrac{ \binom{A}{k} \; (M)_{nk} \; K_n(A-k, M-nk)}{ (n!)^k} }$$ with the following initialization:$\boxed{ K_2(A,M)=(A)_M }$and where$(n)_k$stands for the decreasing factorial :$(n)_k = n(n-1)...(n-k+1)$Numerically: Within a class of$M=30$children, knowing that the year counts$A=365$days... The probability that at least$n=2$children have their birthday the same day is: $$P(365,30,2)\simeq 70,6\%$$ The probability that at least$n=3$children have their birthday the same day is: $$P(365,30,3)\simeq 2,85\%$$ The probability that at least$n=4$children have their birthday the same day is: $$P(365,30,4)\simeq 0,0532\%$$ Nicolas Just like to point out that Trazom's answer is incorrect for the general case - the sets being counted in the outer sum overlap. I don't have enough reputation to comment. I wrote a blog post about the general case here : https://swarbrickjones.wordpress.com/2016/05/08/the-birthday-problem-ii-three-people-or-more/ Anyone looking for generalized birthday problem i.e. How many people are required such that M of them share same birthday with certain probability. This link explain various method for calculating probability of generalized birthday problem. http://mathworld.wolfram.com/BirthdayProblem.html Also this paper talk more about various kind of coincidences we face ib life, interesting read. https://www.stat.berkeley.edu/~aldous/157/Papers/diaconis_mosteller.pdf • "Links to external resources are encouraged, but please add context around the link so your fellow users will have some idea what it is and why it’s there. Always quote the most relevant part of an important link, in case the target site is unreachable or goes permanently offline." – Shraddheya Shendre Sep 10 '17 at 5:35 I am looking at this question and the complicated answers and it's confusing me. Supposing I want to solve in a group of 100 people. what is the probability that at least 3 people share a birthday. So I start from very basic - if there are 3 people, the probability of them sharing a birthday is $$\frac{1}{365} *\frac{1}{365}*\frac{1}{365}*(365)=\frac{1}{(365)^2}$$ 1/365 the prob. of 1 person having a birthday on a particular day multiplied by each person's probability multiplied by the total no. of days. Similarly if there are 4 people, the probability of at least 3 of them sharing a birthday would be$\frac{1}{(365)^2}*^4C_3 $. and similarly for x people,$\frac{1}{(365)^2}*^XC_3 $I am trying to find the fault in this logic. • Welcome to Math.SE! You have posted this as an Answer, but it really seems to be more of a new Question. If you wanted to understand why your computation is wrong, one approach would be trying to apply it to a simplified problem, such as "What is the probability that three people share the day of the week on which they were born?" But don't post as an Answer that the other answers are confusing to you. – hardmath Apr 8 '16 at 18:50 • No, what I meant is that I feel this is the answer, but I am not a 100% sure of it. It is just my attempt of answering the question but i would welcome critique on it. – yavvee Apr 8 '16 at 18:56 • Let me briefly elaborate on how you can verify your approach is wrong. Note that a probability should always fall between$0$and$1$, but as$X$grows, your expression exceeds$1$. This is easily seen when we consider the days of the week simplification. The chance that three people are born on the same day of the week is indeed$\frac{1}{7^2}$, but the chance that three out of eight people share a day of week for birth cannot be$\frac{\binom{8}{3}}{7^2}$because that exceeds$1\$. – hardmath Apr 10 '16 at 0:22