Introduction:
The problem we’re looking at today was the easiest of the 6 problems given at the International Math Olympiad, in 1984.
To solve this problem, we will employ the use of the HM-GM-AM-QM inequality.
As a refresher, for any set of n positive numbers we have: , where:
- HM (harmonic mean): is n divided by the sum of the reciprocals of the numbers.
- GM (geometric mean): is the nth root of the product of the numbers
- AM (arithmetic mean): is the sum of the numbers divided by n
- QM (quadratic mean): is the square root of the arithmetic mean of the squares of the numbers.
Solutions:
We will divide our problem into two complementary cases.
Case I: At least one of the numbers is equal to 0
Without loss of generality due to symmetry we can assume .
Replacing x with 0 in our initial inequality we arrive at this new problem:
The left-hand side (LHS) is obvious, as both numbers are positive
For the right-hand side (RHS), we use the AM-GM inequality, which quickly solves it
Case II: None of the numbers is equal to 0
a. LHS:
Knowing that the numbers are strictly positive, we move to the left side and divide by the product of the numbers.
Simplifying and re-ordering, we arrive at:
This is a trivial consequence of AM-HM inequality.
b. RHS:
We re-write our inequality as such:
We further split this case into two:
i) All numbers are less than 0.5
In this case, (1-2x), (1-2y), and (1-2z) are positive, so we can apply GM-AMto them; which directly proves our inequality
ii) At least one number greater than 0.5
We know that so it is less than