You have 10 different empty containers: 6 can contain up to 3 L of water and 4 can contain up to 8 L of water.
How many ways are there to fill up exactly 46 L of water into these containers, such that the number of liters of water in each container is an integer?
Details and Assumptions:
This section requires Javascript.
You are seeing this because something didn't load right. We suggest you, (a) try
refreshing the page, (b) enabling javascript if it is disabled on your browser and,
finally, (c)
loading the
non-javascript version of this page
. We're sorry about the hassle.
The scenario at hand can be handled by using a generating function approach.
The sum of volumes of water in each container should be 46 L.
Also, volume of water is quantized (minimum = 1 L ).
You would look for the coefficient of x 4 6 in
( 1 + x + x 2 + x 3 ) 6 ( 1 + x + x 2 + . . . . + x 8 ) 4 = ( k = 0 ∑ 3 x k ) 6 ( k = 0 ∑ 8 x k ) 4
That would be equivalent to the coefficient of x 4 in the above polynomial, because the maximum power of x in the polynomial is 5 0 , and the polynomial is symmetric (product of two symmetric polynomials is symmetric).
So, the desired answer would be the coefficient of x 4 in P = ( 1 − x 4 ) 6 ( 1 − x 9 ) 4 ( 1 − x ) − 1 0 (Sum of geometric series)
Now, the coefficient of x r in the Maclaurin series expansion of ( 1 − x ) − 1 0 is ( r 1 0 + r − 1 ) .
So, the coefficient of x 4 in P can be found by first taking x 4 from the 1st bracket and x 0 from the 2nd and 3rd brackets, and then x 0 from the 1st and 2nd brackets and x 4 from the third bracket.
Therefore, desired answer is ( 4 1 0 + 4 − 1 ) − ( 1 6 ) = ( 4 1 3 ) − 6 = 7 0 9
There may be other ways to solve this problem involving case analysis.