Problem:
Suppose that , , and are distinct positive integers such that . Across all possible values of , , and , compute the minimum value of .
Solution
Solution:
We claim that is the desired solution.
Observe that , so clearly and . Furthermore, and must be distinct powers of the same integer.
If and were powers of an integer , then we would have . Thus, we only need to consider when they are powers of .
If then , so , which makes the values not distinct.
If we get our aforementioned solution.
Any other sum to at least , in which case .
Thus 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.