Maths Olympiad Prep

Library / /606 of 740

, 2024

Number theory Difficulty 5.3 AIME, harder Prove it United States

Problem:

Positive integers aa, bb, and cc have the property that lcm(a,b)\operatorname{lcm}(a, b), lcm(b,c)\operatorname{lcm}(b, c), and lcm(c,a)\operatorname{lcm}(c, a) end in 4, 6, and 7, respectively, when written in base 10. Compute the minimum possible value of a+b+ca+b+c.

Solution

Solution:

Note that a+b+c=28a+b+c=28 is achieved when (a,b,c)=(19,6,3)(a, b, c)=(19,6,3). To show we cannot do better, first observe we would need a+c<27a+c<27 and lcm(a,c)ac1313=169\operatorname{lcm}(a, c) \leq a c \leq 13 \cdot 13=169, which is only possible when lcm(a,c)\operatorname{lcm}(a, c) is 7,17,57,777, 17, 57, 77, or 117117. We do casework on each value:

- lcm(a,c)=7\operatorname{lcm}(a, c)=7. Then aa and cc are both 11 or 77, so lcm(a,b)\operatorname{lcm}(a, b) and lcm(b,c)\operatorname{lcm}(b, c) are both bb or 7b7b. It is impossible for one of bb and 7b7b to end in 44 and the other to end in 66.

- lcm(a,c)=17\operatorname{lcm}(a, c)=17. The same argument as above proves this case is also impossible.

- lcm(a,c)=77\operatorname{lcm}(a, c)=77. Since the divisors of 7777 only end in 11 and 77, the same argument as above rules out this case.

- lcm(a,c)=57\operatorname{lcm}(a, c)=57. As a+c<27a+c<27, we must have {a,c}={3,19}\{a, c\}=\{3,19\}. Then bb is even and less than 66, so it's easy to verify there are no solutions here.

- lcm(a,c)=117\operatorname{lcm}(a, c)=117. As a+c<27a+c<27, we must have {a,c}={9,13}\{a, c\}=\{9,13\}. Then bb is even and less than 66, so it's easy to verify there are no solutions here.

This rules out all cases, so 2828 is optimal.

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: MathNet, licensed CC-BY-4.0. Statement reproduced verbatim; metadata (topic, difficulty) added by this project.