I've been banging my head on a wall with this question. I'm designing a game and would like to implement a loot system inspired by a game called "Vermintide" where players roll a certain number of dice and gain loot according to the result.
I want my players to get rewards depending on the result of the dice. but I need to evaluate the quality of items, and the number of dice they get to throw based on the probability.
Essentially if they get doubles they get a standard item, if they get triples they get a magic item etc...
I heard of the "birthday problem" and "multinomials" but most of what I could find about it seemed to be very particular cases (I found birthday problem for 2 or more but not for 3 or more, which seems much less trivial).
Is there a smart way to go about this problem which I first thought was going to be trivial, and the more I search the more it seems complicated.
The OP is correct in saying that this is a generalization of the Birthday Problem and that it is harder because we are interested in cases where the number of people with the same birthday is greater than two. One approach is by way of exponential generating functions.
Let's take a concrete example. Suppose we want to roll $10$ six-sided dice and find the probability that at least one number comes up $5$ or more times. It seems easier to consider the complementary event, i.e. all numbers come up $4$ or fewer times. There are $6^{10}$ possible sequences of die rolls, all of which we assume are equally likely. We would like to count the number of sequences in which no number comes up more than $4$ times. We generalize the problem a bit and think about a sequence of $n$ die rolls, and let the number of sequences in which no number appears more than $4$ times be $a_n$.
The exponential generating function of $a_n$ is defined to be $$f(x) = \sum_{n=0}^{\infty} \frac{1}{n!} a_n x^n$$ Since each die has $6$ sides and each number appears no more than $4$ times, $$f(x) = \left( \sum_{i=0}^4 \frac{1}{i!} x^i \right)^6$$ The number we want in our problem, $a_{10}$, is $10!$ times the coefficient of $x^{10}$ when $f(x)$ is expanded. I suppose a pencil and paper solution is possible, but I took the easy way out and used a computer algebra system to find that the coefficient of $x^{10}$ is $2177 / 144$. Therefore the number of sequences of $10$ die rolls in which no number appears more than $4$ times is $$a_{10} = 10! \times \frac{2177}{ 144} = 54,860,400$$
So the probability that no number appears more than $4$ times in $10$ rolls is $$p = \frac{a_{10}}{6^{10}} = 0.907291$$ and the probability that at least one number appears $5$ times or more is $$1-p = 0.0927093$$