Art of Problem Solving
AoPS Online
Math texts, online classes, and more
for students in grades 5-12.
Visit AoPS Online ‚
Books for Grades 5-12 Online Courses
Beast Academy
Engaging math books and online learning
for students ages 6-13.
Visit Beast Academy ‚
Books for Ages 6-13 Beast Academy Online
AoPS Academy
Small live classes for advanced math
and language arts learners in grades 2-12.
Visit AoPS Academy ‚
Find a Physical Campus Visit the Virtual Campus

1969 IMO Problems/Problem 6

Revision as of 03:16, 19 November 2023 by Tomasdiaz (talk | contribs) (→‎Solution 2)

Problem

Prove that for all real numbers $x_1, x_2, y_1, y_2, z_1, z_2$, with $x_1 > 0, x_2 > 0, y_1 > 0, y_2 > 0, z_1 > 0, z_2 > 0, x_1y_1 - z_1^2 > 0, x_2y_2 - z_2^2 > 0$, the inequality\[\frac{8}{(x_1 + x_2)(y_1 + y_2) - (z_1 + z_2)^2} \leq \frac{1}{x_1y_1 - z_1^2} + \frac{1}{x_2y_2 - z_2^2}\]is satisfied. Give necessary and sufficient conditions for equality.

Solution

Let $A=x_1y_1 - z_1^2>0$ and $B=x_2y_2 - z_2^2>0$

From AM-GM:

$\sqrt{AB} \le \frac{A+B}{2}$ with equality at $A=B$

$4AB \le (A+B)^2$

$\frac{4}{A+B} \le \frac{A+B}{AB}$

$\frac{8}{2(A+B)} \le \frac{A+B}{AB}$

$\frac{8}{2(A+B)} \le \frac{1}{A}+\frac{1}{B}$ [Equation 1]

$(x_1 + x_2)(y_1 + y_2) - (z_1 + z_2)^2=x_1y_1+x_2y_2+x_1y_2+x_2y_1-z_1^2-2z_1z_2-z_2^2$

$(x_1 + x_2)(y_1 + y_2) - (z_1 + z_2)^2=(A+B)+x_1y_2+x_2y_1-2z_1z_2$

since $x_1y_1>z_1^2$ and $x_2y_2>z_2^2$, and using the Rearrangement inequality

then $x_1y_1+x_2y_2-z_1z_1-z_2z_2 \le x_1y_2+x_2y_1-z_1z_2-z_1z_2$

$(A+B) \le x_1y_2+x_2y_1-2z_1z_2$

$2(A+B) \le x_1y_1+x_2y_2+x_1y_2+x_2y_1-z_1^2-2z_1z_2-z_2^2$

$2(A+B) \le (x_1 + x_2)(y_1 + y_2) - (z_1 + z_2)^2$ [Equation 2]

Therefore, we can can use [Equation 2] into [Equation 1] to get:

$\frac{8}{(x_1 + x_2)(y_1 + y_2) - (z_1 + z_2)^2} \le \frac{1}{A}+\frac{1}{B}$

Then, from the values of $A$ and $B$ we get:

$\frac{8}{(x_1 + x_2)(y_1 + y_2) - (z_1 + z_2)^2} \leq \frac{1}{x_1y_1 - z_1^2} + \frac{1}{x_2y_2 - z_2^2}$

With equality at $x_1y_1 - z_1^2=x_2y_2 - z_2^2>0$ and $x_1=x_2, y_1=y_2, z_1=z_2$

~Tomas Diaz. orders@tomasdiaz.com

Solution 2

This solution is actually more difficult but I added it here for fun to see the generalized case as follows:

Prove that for all real numbers $a_i, b_i$, for $i=1,2,...,n$ with $a_i > 0, b_i > 0$

and $\prod_{i=1}^{n-1}a_i-a_n^{n-1}>0, \prod_{i=1}^{n-1}b_i-b_n^{n-1}>0$ the inequality

\[\frac{2^n}{\prod_{i=1}^{n-1}(a_i + b_i) - (a_n + b_n)^{n-1}} \leq \frac{1}{\prod_{i=1}^{n-1}a_i-a_n^{n-1}} + \frac{1}{\prod_{i=1}^{n-1}b_i-b_n^{n-1}}\]is satisfied.

Let $A=\prod_{i=1}^{n-1}a_i-a_n^{n-1}$ and $\prod_{i=1}^{n-1}b_i-b_n^{n-1}>0$

From AM-GM:

$\sqrt{AB} \le \frac{A+B}{2}$ with equality at $A=B$

$4AB \le (A+B)^2$

$\frac{4}{A+B} \le \frac{A+B}{AB}$

$\frac{2^n}{2^{n-2}(A+B)} \le \frac{A+B}{AB}$

$\frac{2^n}{2^{n-2}(A+B)} \le \frac{1}{A}+\frac{1}{B}$ [Equation 3]

Here's the difficult part where I'm skipping steps:

we prove that $2^{n-2}(A+B) \le \prod_{i=1}^{n-1}(a_i + b_i) - (a_n + b_n)^{n-1}$

and replace in [Equation 3] to get:

$\frac{2^n}{\prod_{i=1}^{n-1}(a_i + b_i) - (a_n + b_n)^{n-1}} \leq \\le \frac{1}{A}+\frac{1}{B}$

and replace the values of "A" and $B$ to get:

$\frac{2^n}{\prod_{i=1}^{n-1}(a_i + b_i) - (a_n + b_n)^{n-1}} \leq \frac{1}{\prod_{i=1}^{n-1}a_i-a_n^{n-1}} + \frac{1}{\prod_{i=1}^{n-1}b_i-b_n^{n-1}}


Alternate solutions are always welcome. If you have a different, elegant solution to this problem, please add it to this page.

See Also

1969 IMO (Problems) • Resources
Preceded by
Problem 5 		1 • 2 • 3 • 4 • 5 • 6 Followed by
Last Question
All IMO Problems and Solutions
Retrieved from "https://artofproblemsolving.com/wiki/index.php?title=1969_IMO_Problems/Problem_6&oldid=204629"