Maths Olympiad Prep

Library / /70 of 94

Algebra Difficulty 5.1 AIME, harder Prove it United States

Problem:

Find the minimum possible value of the largest of xyx y, 1xy+xy1-x-y+x y, and x+y2xyx+y-2 x y if 0xy10 \leq x \leq y \leq 1.

Solution

Solution:

I claim the answer is 49\frac{4}{9}. Let s=x+ys = x + y, p=xyp = x y, so xx and yy are s±s24p2\frac{s \pm \sqrt{s^{2} - 4p}}{2}. Since xx and yy are real, s24p0s^{2} - 4p \geq 0.

If one of the three quantities is less than or equal to 19\frac{1}{9}, then at least one of the others is at least 49\frac{4}{9} by the pigeonhole principle since they add up to 11.

Assume that s2p<49s - 2p < \frac{4}{9}, then s24p<(49+2p)24ps^{2} - 4p < (\frac{4}{9} + 2p)^{2} - 4p, and since the left side is non-negative we get
0p259p+481=(p19)(p49). 0 \leq p^{2} - \frac{5}{9} p + \frac{4}{81} = \left(p - \frac{1}{9}\right)\left(p - \frac{4}{9}\right).
This implies that either p19p \leq \frac{1}{9} or p49p \geq \frac{4}{9}, and either way we're done.

This minimum is achieved if xx and yy are both 13\frac{1}{3}, so the answer is 49\frac{4}{9}, as claimed.

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.