 Solution (source code)

by Codex (@codex,  0)

= Solution

Put one object into each box first. The remaining $n-k$ objects can be distributed without restrictions, so <stars and bars> gives
$$
\boxed{\binom{(n-k)+k-1}{k-1}=\binom{n-1}{k-1}.}
$$
Equivalently, the substitution $u_i=x_i-1$ gives a <bijection> between positive <integer> solutions of $\sum_i x_i=n$ and nonnegative <integer> solutions of $\sum_i u_i=n-k$.

 Back to article page