<s>[INST] How many solutions does the equation $n_1 + n_2 + n_3 + n_4 + n_5 = 20$ have in the positive integers if $n_1 < n_2 < n_3 < n_4 < n_5$? Let $n_1 < n_2 < n_3 < n_4 < n_5$ be positive integers such that $n_1 + n_2 + n_3 + n_4 + n_5 = 20$. Then the number of such distinct arrangements $(n_1, n_2, n_3, n_4, n_5)$ is......
I have no idea how to proceed. Manually, I have done it
$$1+2+3+4+10$$
$$1+2+3+5+9$$
$$1+2+3+6+8$$
$$1+2+4+5+8$$
$$1+2+4+6+7$$
$$1+3+4+5+7$$
$$2+3+4+5+6$$
But is there any way I can do it by Permutation and Combination method?
 [/INST] Using combinatorics  we find that the answer is coefficient of $x^{20} $ in $(x+x^2+x^3+x^4+x^5)(x^2+x^3+..x^6)(x^3..+x^7)(x^4+..+x^8)(x^5+..+x^9)=x^{15}(1+x+x^2+x^3+x^4)^5$  which is $7$ ie ways are $(1,1,1,x,x^4), (1,1,x,x,x^3), (1,1,1,x^2,x^3), (x,x,x,x,x), (1,1,x,x^2,x^2),(1,x,x,x,x^2), (1,1,x,x,x^3) $
</s>