Explain why the count of positive / non-negative integer solutions to the equation $x_1 + x_2 + \cdots + x_k=n$ is equivalent to the case of putting $n$ indistinguishable balls into $k$ distinguishable boxes.
The solution for this problem is available for $0.99.
You can also purchase a pass for all available solutions for $99.