Maths Olympiad Prep

Library / /391 of 740

, 2019

Number theory Difficulty 5.0 AIME, harder Prove it United States

Problem:
Let aa, bb, cc be positive integers such that
a77+b91+c143=1 \frac{a}{77} + \frac{b}{91} + \frac{c}{143} = 1
What is the smallest possible value of a+b+ca + b + c?

Solution

Solution:
We need 13a+11b+7c=100113a + 11b + 7c = 1001, which implies 13(a+b+c77)=2b+6c13(a + b + c - 77) = 2b + 6c. Then 2b+6c2b + 6c must be divisible by both 22 and 1313, so it is minimized at 2626 (e.g. with b=10b = 10, c=1c = 1). This gives a+b+c=79a + b + c = 79.

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.