Difference between revisions of "1969 IMO Problems/Problem 6"
(→Solution) |
|||
| Line 43: | Line 43: | ||
~Tomas Diaz. orders@tomasdiaz.com | ~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 <math>a_i, b_i</math>, for <math>i=1,2,...,n</math> with <math>a_i > 0, b_i > 0</math> | ||
| + | |||
| + | and <math>\prod_{i=1}^{n-1}a_i-a_n^{n-1}>0, \prod_{i=1}^{n-1}b_i-b_n^{n-1}>0</math> the inequality | ||
| + | |||
| + | <cmath>\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}}</cmath>is satisfied. | ||
| + | |||
| + | |||
Revision as of 03:08, 19 November 2023
Contents
Problem
Prove that for all real numbers
, with
, the inequality
is satisfied. Give necessary and sufficient conditions for equality.
Solution
Let
and
From AM-GM:
with equality at
[Equation 1]
since
and
, and using the Rearrangement inequality
then
[Equation 2]
Therefore, we can can use [Equation 2] into [Equation 1] to get:
Then, from the values of
and
we get:
With equality at
and
~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
, for
with
and
the inequality
is satisfied.
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 | ||