We consider a general balanced urn with parameters $a_{0}, b_{0}, a, b, c, d \in \mathbb{N}$ satisfying $a + b = c + d = s$. For $n \geqslant 1$, an outcome resulting from $n$ successive draws is modeled by the $n$-tuple indicating the color and number of the balls successively obtained. We denote by $\Omega_{n}$ the set of possible outcomes of these $n$ draws. By examining the number of balls in the urn just before each draw, justify that, for $n \geqslant 1$, $$\operatorname{card}(\Omega_{n}) = (a_{0} + b_{0}) \times \cdots \times (a_{0} + b_{0} + s(n-1)) = s^{n} L_{n}\left(\frac{a_{0} + b_{0}}{s}\right).$$
We consider a general balanced urn with parameters $a_{0}, b_{0}, a, b, c, d \in \mathbb{N}$ satisfying $a + b = c + d = s$. For $n \geqslant 1$, an outcome resulting from $n$ successive draws is modeled by the $n$-tuple indicating the color and number of the balls successively obtained. We denote by $\Omega_{n}$ the set of possible outcomes of these $n$ draws.
By examining the number of balls in the urn just before each draw, justify that, for $n \geqslant 1$,
$$\operatorname{card}(\Omega_{n}) = (a_{0} + b_{0}) \times \cdots \times (a_{0} + b_{0} + s(n-1)) = s^{n} L_{n}\left(\frac{a_{0} + b_{0}}{s}\right).$$