2022 AIME I Problems/Problem 7

Revision as of 20:10, 17 February 2022 by Jgplay (talk | contribs)

Solution 1 (sophisticated bash)

Since we are trying to minimize \[\dfrac{a \cdot b \cdot c - d \cdot e \cdot f}{g \cdot h \cdot i},\] we want the numerator to be as small as possible and the denominator as big as possible. One way to do this is to make the numerator one and the denominator as large as possible. This means that $a\cdot b\cdot c$ has to be a different parity than $d\cdot e\cdot f.$ Using this, and reserving $9$ and $8$ for the denominator, we notice that \[\dfrac{2 \cdot  3\cdot 6 - 7 \cdot 1 \cdot 5}{9 \cdot 8 \cdot 4}=\frac{1}{288}.\] Since the maximum denominator is $9\cdot 8\cdot 7=504,$ which is less than $2\cdot 288,$ $\frac{1}{288}$ will be less than any other fraction we can come up with with a numerator greater than $1.$ This means that all we need to check is fractions with numerator $1$ and numerator greater than $288$. The only alternatives we need to consider are $9\cdot 8\cdot 6$ and $9\cdot 8\cdot 5$ in the denominator. The parity restriction allows us to focus on numerators where either $a,b,c$ are all odd or $d,e,f$ are all odd, so our choices are $7\cdot 3\cdot 1$ (paired with either $2\cdot 4\cdot 5$ or $2\cdot 4\cdot 6$) or $5\cdot 3\cdot 1$. Neither gives us a numerator of $1,$ so we can conclude that the minimum fraction is $\frac{1}{288}$ and thus the answer is $1+288=\boxed{289}$.