TITLE: Splitting the birthday paradox into months
QUESTION [5 upvotes]: One of the biggest studies in my universities' statistics class is the Birthday Paradox. It main goal is to determine that, given n students in a class, what's the probability that at least two of these students share a birthday.
Now, suppose there are k students in a class and every student is equally likely to be born in any of the twelve months of the year. One of the questions we were asked is:

What is the minimum value for k such that the probability there are two (or more) students born in the same month is at least 1/2?

I modified the original equation to try and account for the fact that this takes count of months and not the entire year.
P(A) = Event that two people have the same birthday in the month.
Thus, $$P(A') = \frac{k! \cdot365 {365 \choose 30}}{365^k}$$
Where the ${365 \choose 30}$ is taking into account a specific given month. (This is where I believe I'm making an error)
Then, the answer can be achieved by $$P(A) = 1-P(A')$$
Finally, I can use some bounding and solve for $$P\left(A \geq \frac{1}{2}\right) $$
However, I'm missing lots of calculations in between the lines which I am not sure how to achieve. How can I go about solving this problem appropriately?

REPLY [3 votes]: If you understand the solution of the birthday problem, just replace the number 365 (days) by 12 (months). This with the approximation that months are equiprobable even though they have different number of days (as well as other caveats such as season, Valentine-day effect and so on!).
You want
$$
p=\frac{12^n-\frac{12!}{(12-n)!}}{12^n}\geq .5
$$
which happens for $n=5$ people ($p=.618$).