Maths Olympiad Prep

Library / /511 of 740

Number theory Difficulty 5.1 AIME, harder Prove it United States

Problem:
Suppose that aa, bb, and cc are distinct positive integers such that abbc=aca^{b} b^{c} = a^{c}. Across all possible values of aa, bb, and cc, compute the minimum value of a+b+ca + b + c.

Solution

Solution:
We claim that (8,2,3)(8, 2, 3) is the desired solution.

Observe that acb=bca^{c-b} = b^{c}, so clearly a1a \neq 1 and b<ab < a. Furthermore, aa and bb must be distinct powers of the same integer.

If aa and bb were powers of an integer n>2n > 2, then we would have a+b+c32+3+1=13a + b + c \geq 3^{2} + 3 + 1 = 13. Thus, we only need to consider when they are powers of 22.

If (a,b)=(4,2)(a, b) = (4, 2) then (cb)=c2(c-b) = \frac{c}{2}, so c=4c = 4, which makes the values not distinct.

If (a,b)=(8,2)(a, b) = (8, 2) we get our aforementioned solution.

Any other (a,b)(a, b) sum to at least 1212, in which case a+b+c13a + b + c \geq 13.

Thus 1313 is minimal.

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.