Introduction to Probability · Problem 12.1.14

Random Walks — Grinstead & Snell

Mathematics — Probability · random-walks-multinomial

Problem

Prove that ∑j,k(13nn!j!k!(n−j−k)!)=1,\sum_{j,k} \left(\frac{1}{3^n} \frac{n!}{j!k!(n-j-k)!}\right) = 1, where the sum extends over all non-negative jj and kk such that j+k≤nj + k \leq n. Hint: Count how many ways one can place nn labelled balls in 3 labelled urns.

Related theory

Browse the problem library