Try it on paper first. A hint, the key idea and the worked solution are here when you need them.
Here is a statement that many olympiad solutions use.
Claim. If are positive and , then , with equality only when every .
For positive numbers the means come in a fixed order, with equality only when all the numbers are equal:
Check an answer or open a hint to unlock the worked solution.
Have you tried it?
Work it out on paper first. It is fine to get stuck or make a mistake: that is how we learn. When you are ready, go through the solution one step at a time, and check each step against your own.
Given. Positive numbers with product .
Plan. Merge two numbers into one, use the induction hypothesis, and add back what was lost.
Step 1. The base case. For the only number is , and the sum is .
Step 2. The induction step. Suppose the claim holds for numbers, and take numbers with product . If all are , the sum is . Otherwise one is above and one is below ; call them and . Then , which expands to .
Step 3. Merge. The numbers have product . By the hypothesis their sum is at least . So
The inequality is strict unless every number is . This completes the induction.
Step 4. AM-GM. Put . Their product is . So , which is .
Step 5. Five numbers. The geometric mean is , so the sum is at least . The squares have product and geometric mean , so their sum is at least . Both bounds are reached when every number is .
Answer: proof as above; the least sum is and the least sum of squares is . Proof complete.
Log in to join the discussion.
Loading…