This sort of problem is ideal for generating functions.
Look at this expansion.
The coefficient of is the answer you want.
A teacher has just completed writing the final examination for his course in mathematics. This examination has 12 questions, whose total value is to be 200 points. In how many ways can the teacher assign the 200 points if each question must count for at least 10, but not more than 25 points and the point value for each question is to be a multiple of 5?
I would like to know what is wrong in the starting point of my solution:
This is equivalent to finding the integer solutions to
5(x1 + x2 + … + x12) = 200 <=> x1 + x2 + … + x12 = 200/5 <=> x1 + x2 + … + x12 = 40
where 10/5 ≤ xi/5 < 25/5 <=> 2 ≤ xi ≤ 5
for all 1 ≤ i ≤ 12.
I share Plato's interest in generating functions and computer algebra systems. But if you need to compute the answer by hand, or at least by hand and calculator, here is a way.
Start with the problem in the form: How many integer solutions are there to
Then the ordinary power series generating function is
We are now in a position to read off the coefficient of . First a little arithmetic: note that 40 - 24 = 16 and 16 = 0 + 16 = 4 + 12 = 8 + 8 = 12 + 4 = 16 + 0. Then the coefficient we want is