I am trying to grasp the intuition behind this example.
Show that $\sum_{n \geq 0} p_{\leq k}(n)x^n = \prod_{i=1}^k \frac{1}{1-x^i}$ where $p_{\leq k}(n)$ denotes the number of partitions of the integer $n$ into parts of size at most $k$.
The book A Walk Through Combinatorics starts off the solution by determining the coefficients of $x^n$ on the right hand side, but I am not really sure how this helps our case. Are we supposed to show that the coefficients of $x^n$ on the right hand side shows the integer partition of $n$ with parts at most $k$?
If so, my question is:
What should one show to prove that the coefficients of $x^n$ demonstrates an integer partition of $n$ with parts no greater than $k$? What do we need to show that we can finally say "coefficients indeed demonstrate an integer partition of $n$ with parts at most $k$?"