# Count the number of ways in which these stamps can be posted on the envelope.

The postal stamps of three different valuations viz $2$ cents, $3$ cents and $4$ cents are available. If the number of ways in which these stamps can be posted on envelope one after the other so that the total valuation of stamps on the envelope is $10$ cents is $N$. Find $N$.

I have actually solved the problem using the method given below. Consider the function $$f(n)=f(n-2)+f(n-3)+f(n-4)$$ where $f(n)$ represents the ways in which stamps so arranged give the sum as $n$ on the envelope. Hence we need to find $f(10)$. Now on quick brute force we get $f(2)=1, f(3)=1, f(4)=2$ and $f(5)=2$. Using these I got $f(10)$ as $17$ which is the correct answer.

But I want to solve this problem using the binomial coefficient method. For example the answer to this question must be equal to the coefficient of $x^{10}$ in the expansion of $$(x^0+x^2+x^4+x^6+x^8+x^{10})(x^0+x^3+x^6+x^9)(x^0+x^4+x^8)$$

But using this I get the coefficient of $x^{10}$ as $5$ which isn't the correct answer. Can someone please check my method and place your suggestions over how should I continue in this method.

Note : I think that many similar questions might have been asked on MSE but I am focusing on just one particular method to solve such problem. So please don't mark it as duplicate.

• Why is $f(5) = 2$? Does order matter? – feynhat Jan 10 '18 at 17:01
• @feynhat $(3, 2)\ (2,3)$ – John Lou Jan 10 '18 at 17:02
• @JohnLou Oh right. OP didn't mention that order mattered. – feynhat Jan 10 '18 at 17:05
• Well I did- " If the number of ways in which these stamps can be posted on envelope ""one after the other """ – Rohan Shinde Jan 10 '18 at 17:16

Those are the five combinations of denominations, which you got from the $x^{10}$ coefficient.
As for arranging the stamps, that's a different problem entirely. The number of arrangements for each case above are $1,4,3,6,3$, respectively, which gives your $17$.