Maths Olympiad Prep

Library / /2 of 11

, 2025

Algebra Difficulty 5.9 AIME, harder Prove it Czech-Polish-Slovak Mathematical Match

Let aa, bb, cc, dd be nonnegative real numbers for which a2+b2=ac+bda^2 + b^2 = ac + bd holds and cc, dd are not both zero. Find maximum and minimum value of the expression
ad+bccdc2+d2. \frac{ad + bc - cd}{c^2 + d^2}.

Solutions — 2

Solution 1

We will show that the maximum value is 12\frac{1}{2} and the minimum is 12-\frac{1}{2}. For maximum, after some rearranging, we want to prove
2(ad+bccd)c2+d2, 2(ad + bc - cd) \leq c^2 + d^2,
or
2(ad+bc)(c+d)2. 2(ad + bc) \leq (c + d)^2.
After adding double the expression ac+bd=a2+b2ac + bd = a^2 + b^2 to both sides of this inequality, we will get equivalent inequality
2(a+b)(c+d)=2(ad+bc+ac+bd)(c+d)2+2a2+2b2, 2(a + b)(c + d) = 2(ad + bc + ac + bd) \leq (c + d)^2 + 2a^2 + 2b^2,
which can be further rearranged to
0(c+d)22(a+b)(c+d)+(a+b)2+(ab)2(c+dab)2+(ab)2, 0 \leq (c+d)^2 - 2(a+b)(c+d) + (a+b)^2 + (a-b)^2 \leq (c+d-a-b)^2 + (a-b)^2,
which clearly holds. Moreover, this maximal value is reached by a=b=c=d>0a = b = c = d > 0.

For the minimum value, notice that if aca \geq c or bdb \geq d holds, ad+bcadcdad + bc \geq ad \geq cd and the expression is non-negative. So for it to be negative, both a<ca < c, b<db < d must hold and a2+b2<ac+bda^2 + b^2 < ac + bd if aa and bb wouldn't both be 00. As they are equal by given condition, indeed a=b=0a = b = 0 and the minimized expression then becomes cdc2+d2-\frac{cd}{c^2+d^2}, which has minimum 12-\frac{1}{2} as 2cdc2+d22cd \leq c^2 + d^2. Moreover, this minimal value is reached by a=b=0a = b = 0 and c=d>0c = d > 0.

Solution 2

Consider the Cartesian coordinate system and in it, points C=(c,0)C = (c, 0), D=(0,d)D = (0, d) and X=(a,b)X = (a, b). The line passing through CC, DD has equation dx+cycd=0dx + cy - cd = 0. From analytic geometry, the formula for distance of point (m,n)(m, n) to the line ix+jy+k=0ix + jy + k = 0 is known. It is im+jn+ki2+j2\frac{im+jn+k}{\sqrt{i^2+j^2}}, where the distance is oriented according to the vertical position of point (m,n)(m, n) with respect to the given line. With this formula, the distance of point XX to the line through CC, DD is
ad+bccdc2+d2. \frac{ad + bc - cd}{\sqrt{c^2 + d^2}}.
By rearranging the given condition on aa, bb, cc, dd, we get
(ac2)2+(bd2)2=c2+d24, \left(a - \frac{c}{2}\right)^2 + \left(b - \frac{d}{2}\right)^2 = \frac{c^2 + d^2}{4},
which means that the point X=(a,b)X = (a, b) lies on the circle with centre (c2,d2)(\frac{c}{2}, \frac{d}{2}) and radius c2+d22\frac{\sqrt{c^2+d^2}}{2}, which is exactly the circle with diameter CDCD. Such point on circle with diameter CDCD can be at most radius distant from ABAB, so
ad+bccdc2+d2c2+d22 \frac{ad + bc - cd}{\sqrt{c^2 + d^2}} \leq \frac{\sqrt{c^2 + d^2}}{2}
and by rearranging we get the inequality we proved in first solution. Note that the distance from XX to CDCD is nonnegative unless X=(0,0)X = (0,0), as XX would be above the line CDCD, because it lies in the first quadrant by the nonnegativity and the halfcircle with diameter CDCD in first quadrant lies entirely above the line CDCD. From this, the minimum value must happen for X=(0,0)X = (0,0) which gives 12-\frac{1}{2}, as desired.

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.