Consider polynomial distribution with $\{p_{1} \dots p_{n}\}$ , such as $p_{1}+\dots p_{n} = 1$.
As we know $\mathbb{P}(A_{k_{1} \dots k_n}) = C_{n}(k_{1} \dots k_{n}) p_{1}^{k_{1}} \dots p_{n}^{k_{n}}$
How can we get $(k_{1} \dots k_{n})$ , when probability is maximum ?
I thought about some Pascal's triangle but what about $p_{i}$ ? It looks like Markov's chain , but I don't know how to step it. Any hints?