Loading [MathJax]/jax/output/HTML-CSS/jax.js

Tuesday, May 25, 2010

不等式小記

Problem (Austrian Mathematical Olympiad 2008)Prove that the inequality a1ab1bc1c13 holds for all positive real numbers a,b,c with a+b+c=1.

Those who always discuss math with me will know how to solve it, that's not hard. Now it can be easily generalized to a1a11a1a22a1ann1n(n1)/2 with a1+a2++an=1. From this we get for any ai>0,a1+a2++ann(a1a2an(aa11aa22aann)1/ni=1ai)1/(n1).
We have established an extremely ugly lower bound. This inequality is useful if we are given a condition on aaii, for example from now on I can show that if xxyyzz=1,x,y,z>0, then cycxyz3.
Take n=2, set (a1,a2)=(x,y). The inequality reduces to 12(x+y)(xyyx)1/(x+y)(12(x+y))x+yxyyx (at least I think this inequality is somehow useful), by a little bit argument the following holds for all positive x,y, mxm+ym2mnnxn+yn2nNx+y2xy21x+1y(xyyx)1/(x+y).

No comments:

Post a Comment