I know this question has been asked many times, but I'm not looking for the answer here. I'm looking for the explanation. In other words, I want to know WHY is the number of combinations equal to the coefficient of $X^{100}$ in the expansion series.
I cannot grasp the mathematics behind the generalized problem of how many ways can you make a sum of $N$ given $X, Y, Z$, etc. units.
How do you work out $$Q=(x^{a_1}+x^{a_2}+\cdots)(x^{b_1}+x^{b_2}+\cdots)\cdots(x^{r_1}+x^{r_2}+\cdots)?$$ Well, you use the distributive law. You get the sum of a bunch of terms, each of which is a product of terms, taking one from each bracket. So it's a sum of terms of the form $$x^{a_{s_1}}x^{b_{s_2}}\cdots x^{r_{s_{\rm whatever}}}$$ By the laws of exponents, this is $$x^{a_{s_1}+b_{s_2}+\cdots+r_{s_{\rm whatever}}}$$ So the coefficient of $x^n$ when $Q$ is all multiplied out is the number of ways of writing $n$ as a sum of numbers, taking one number from each of the sets $\{a_1,a_2,\dots\},\{b_1,b_2,\dots\},\dots,\{\,r_1,r_2,\dots\}$.
For example: the number of solutions of $c+d+e=10$ where $c$ is taken from $\{\,1,3,6,8\}$, $d$ from $\{\,2,4,7,9\,\}$ and $e$ from $\{\,1,4,5\,\}$ will be the coefficient of $x^{10}$ in $$(x+x^3+x^6+x^8)(x^2+x^4+x^7+x^9)(x^1+x^4+x^5)$$ because when you use the distributive law to multiply that out you get terms each of which is of the form $x^{c+d+e}$ with $c$ taken from $\{\,1,3,6,8\}$, $d$ from $\{\,2,4,7,9\,\}$ and $e$ from $\{\,1,4,5\,\}$.