Maths Olympiad Prep

Library / /48 of 62

Algebra Difficulty 5.9 AIME, harder Prove it United States

Problem:

Let xx and yy be non-negative real numbers that sum to 11. Compute the number of ordered pairs (a,b)(a, b) with a,b{0,1,2,3,4}a, b \in \{0,1,2,3,4\} such that the expression xayb+yaxbx^{a} y^{b} + y^{a} x^{b} has maximum value 21ab2^{1-a-b}.

Solution

Solution:

Let f(x,y)=xayb+yaxbf(x, y) = x^{a} y^{b} + y^{a} x^{b}. Observe that 21ab2^{1-a-b} is merely the value of f(12,12)f\left(\frac{1}{2}, \frac{1}{2}\right), so this value is always achievable.

We claim (call this result (*)) that if (a,b)(a, b) satisfies the condition, so does (a+1,b+1)(a+1, b+1). To see this, observe that if f(x,y)21abf(x, y) \leq 2^{1-a-b}, then multiplying by the inequality xy14x y \leq \frac{1}{4} yields xa+1yb+1+ya+1xb+121abx^{a+1} y^{b+1} + y^{a+1} x^{b+1} \leq 2^{-1-a-b}, as desired.

For the rest of the solution, without loss of generality we consider the aba \geq b case. If a=b=0a = b = 0, then f(x,y)=2f(x, y) = 2, so (0,0)(0,0) works. If a=1a = 1 and b=0b = 0, then f(x,y)=x+y=1f(x, y) = x + y = 1, so (1,0)(1,0) works. For a2a \geq 2, (a,0)(a, 0) fails since f(1,0)=1>21af(1,0) = 1 > 2^{1-a}.

If a=3a = 3 and b=1b = 1, f(x,y)=xy(x2+y2)=xy(12xy)f(x, y) = x y (x^{2} + y^{2}) = x y (1 - 2 x y), which is maximized at xy=14x=y=12x y = \frac{1}{4} \Longleftrightarrow x = y = \frac{1}{2}, so (3,1)(3,1) works. However, if a=4a = 4 and b=1b = 1, f(x,y)=xy(x3+y3)=xy((x+y)33xy(x+y))=xy(13xy)f(x, y) = x y (x^{3} + y^{3}) = x y ((x+y)^{3} - 3 x y (x+y)) = x y (1 - 3 x y), which is maximized at xy=16x y = \frac{1}{6}. Thus (4,1)(4,1) does not work.

From these results and ()(*), we are able to deduce all the pairs that do work (\swarrow represents those pairs that work by (*)):

Figure 1

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.