Maths Olympiad Prep

Library / /20 of 82

Algebra Difficulty 4.6 AIME Prove it United States

Problem:

Given that a+b+c=5a + b + c = 5 and that 1a,b,c21 \leq a, b, c \leq 2, what is the minimum possible value of 1a+b+1b+c\frac{1}{a+b} + \frac{1}{b+c}?

Solution

Solution:

If a>1a > 1 and b<2b < 2, we can decrease the sum by decreasing aa and increasing bb. You can follow a similar procedure if c>1c > 1 and b<2b < 2. Therefore, the sum is minimized when b=2b = 2.

We can then cross-multiply the two fractions and see that we are trying to minimize
a+c+4(a+2)(c+2)=7(a+2)(c+2). \frac{a + c + 4}{(a + 2)(c + 2)} = \frac{7}{(a + 2)(c + 2)}.
The product of two numbers with a fixed sum is maximized when those two numbers are equal, so 7(a+2)(c+2)\frac{7}{(a + 2)(c + 2)} is minimized for a=c=32a = c = \frac{3}{2}, which gives us an answer of 47\frac{4}{7}.

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.