In Friedman's urn model ($a_{0} = 1, b_{0} = 0, a = d = 0, b = c = 1$), fix an integer $n \geqslant 2$.
Using the Taylor expansion of $g_{n}$ to order $n$ at 0, deduce that, for all $m$ in $\llbracket 1, n \rrbracket$, $$P(X_{n} = m) = \frac{1}{n!} \sum_{k=0}^{m-1} (-1)^{k} \binom{n+1}{k} (m-k)^{n}.$$
In Friedman's urn model ($a_{0} = 1, b_{0} = 0, a = d = 0, b = c = 1$), fix an integer $n \geqslant 2$.

Using the Taylor expansion of $g_{n}$ to order $n$ at 0, deduce that, for all $m$ in $\llbracket 1, n \rrbracket$,
$$P(X_{n} = m) = \frac{1}{n!} \sum_{k=0}^{m-1} (-1)^{k} \binom{n+1}{k} (m-k)^{n}.$$