For how many unordered sets of positive integers, none of which exceed 168, do there exist integers such that ? If your answer is and the correct answer is , then your score on this problem will be .
Solution
As an approximation, we assume are ordered to begin with (so we have to divide by 24 later) and add to 168 with a unique choice of signs; then, it suffices to count with each in and then divide by 24 (we drop the condition that none of them can be zero because it shouldn't affect the answer that much). One way to do this is generating functions. We want the coefficient of in the generating function . Clearing the negative powers, it suffices to find the coefficient of in . To do this we expand the bottom as a power series in : . It remains to calculate . This is almost exactly equal to . Dividing by 24, we arrive at an estimation 762500. Even if we use a bad approximation . ) we get approximately 933000, which is fairly close to the answer.