Maths Olympiad Prep

Library / /262 of 860

Combinatorics Difficulty 5.0 AIME, harder Find the answer

Find the number of solutions in positive integers (k;a1,a2,,ak;b1,b2,,bk)(k ; a_{1}, a_{2}, \ldots, a_{k} ; b_{1}, b_{2}, \ldots, b_{k}) to the equation a1(b1)+a2(b1+b2)++ak(b1+b2++bk)=7a_{1}(b_{1})+a_{2}(b_{1}+b_{2})+\cdots+a_{k}(b_{1}+b_{2}+\cdots+b_{k})=7

A number or a short expression. Spacing and $ signs are ignored.

Solution

Let k,a1,,ak,b1,,bkk, a_{1}, \ldots, a_{k}, b_{1}, \ldots, b_{k} be a solution. Then b1,b1+b2,,b1++bkb_{1}, b_{1}+b_{2}, \ldots, b_{1}+\cdots+b_{k} is just some increasing sequence of positive integers. Considering the aia_{i} as multiplicities, the aia_{i} 's and bib_{i} 's uniquely determine a partition of 7. Likewise, we can determine aia_{i} 's and bib_{i} 's from any partition of 7, so the number of solutions is p(7)=15p(7)=15.

Want a route through all this instead of an archive? The track puts 2,000 problems in a working order, from AMC 10 level to the IMO shortlist.

Source: Omni-MATH, licensed Apache-2.0. Statement and solution reproduced as published; topic and difficulty added by this site.