Problem was to show that
a2+b2+c2≤a3+b3+c3
if a,b,c,>0 and abc=1.
Let us first show that
aa2bb2cc2≥1
If a≥b≥1≥c then we rewrite using c=1ab as
aa2−c2bb2−c2 which is easily seen to be at least 1 (product of numbers ≥1).
If a≥1≥b≥c then we rewrite using a=1bc as
bb2−a2cc2−a2≥1
(product of numbers less than 1 raised to negative powers)
Now for the main problem, we can use the weighted arithmetic mean geometric mean inequality
and get
a.a2+b.b2+c.c2a2+b2+c2≥a2+b2+c2√aa2bb2cc2
But RHS ≥1 and so we are done.
a2+b2+c2≤a3+b3+c3
if a,b,c,>0 and abc=1.
Let us first show that
aa2bb2cc2≥1
If a≥b≥1≥c then we rewrite using c=1ab as
aa2−c2bb2−c2 which is easily seen to be at least 1 (product of numbers ≥1).
If a≥1≥b≥c then we rewrite using a=1bc as
bb2−a2cc2−a2≥1
(product of numbers less than 1 raised to negative powers)
Now for the main problem, we can use the weighted arithmetic mean geometric mean inequality
and get
a.a2+b.b2+c.c2a2+b2+c2≥a2+b2+c2√aa2bb2cc2
But RHS ≥1 and so we are done.
No comments:
Post a Comment