Try it on paper first. A hint, the key idea and the worked solution are here when you need them.
Prove that for positive numbers , and ,
Plan: take natural logarithms, so that the claim becomes . Then notice that the lists and are sorted the same way, and use Chebyshev's inequality.
After the proof, check the claim for , , by working out both sides exactly.
Same order gives the largest sum of products and opposite order the smallest. Chebyshev, for lists sorted the same way:
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 , , .
Plan. Logarithms, then Chebyshev.
Step 1. Take logarithms. Both sides are positive, and is increasing. So the claim is .
Step 2. The order. If then . So the lists and are sorted the same way.
Step 3. Chebyshev. , which is Step 1 multiplied by .
Step 4. Equality. Chebyshev is an equality only when one list is constant, so here when .
Step 5. The check. Left: . Right: .
Answer: ; the inequality holds, with equality only when . Proof complete.
Log in to join the discussion.
Loading…