Prove that
min(a+b+1a+1b)=3√2
Given a2+b2=1(a,b∈R+)
Without using calculus.
MyAttempt
I tried the AM-GM, but this gives min=4.
I used Cauchy-Schwarz to get (a+b)2≤2(a2+b2)=2⇒a+b≤√2
But using Titu's Lemma I get 1a+1b≥4a+b⇒1a+1b≥2√2
I'm stuck here, any hint?
Answer
Notice
a+b+1a+1b=(a+12a+12a)+(b+12b+12b)AM≥GM→≥3[(14a)1/3+(14b)1/3]AM≥GM→≥6(116ab)1/6a2+b2≥2ab→≥6(18(a2+b2))1/6=6(18)1/6=6√2=3√2
Since the value 3√2 is achieved at a=b=1√2, we have
min{a+b+1a+1b:a,b>0,a2+b2=1}=3√2
Notes
About the question how do I come up with this. I basically know the minimum is
achieved at a=b=1√2. Since the bound 3√2 on RHS of is optimal, if we ever want to prove the inequality, we need to use something that is tight when a=b. If we want to use AM ≥ GM, we need to arrange the pieces so that all terms are equal. That's why I split 1a into 12a+12a and 1b into 12b+12b and see what happens. It just turns out that works.
No comments:
Post a Comment