Let a, b, c≥0 be real numbers with a+b+c=1. Show that a+b+c≤a(1+b)+b(1+c)+c(1+a)≤2.
This one wants a proof. Work it on paper, then read the official solution and mark yourself. Be honest about it: the record is only any use to you if it is.
We consider first the left hand inequality. As a+b+c=1 we have: a≤1≤1+b, so a=a2≤a(1+b) Applying this similarly to the other square roots and adding quickly gives: 1=a+b+c≤a(1+b)+b(1+c)+c(1+a). A direct application of the AM-GM inequality does not yield the right hand inequality. Instead, we can tighten the AM-GM inequality by scaling the factors so they are equal when a=b=1/3. This gives: a(1+b)=2a⋅21+b≤22a+41+b. We can add the three cyclical permutations and obtain: 2a⋅21+b+2b⋅21+c+2c⋅21+a≤a+41+b+b+41+c+c+41+a=a+b+c+43+a+b+c=2.
Alternatively, to prove the right hand inequality we may use the Cauchy-Schwarz inequality k=1∑nxkyk≤k=1∑nxk2⋅k=1∑nyk2 with n=3, x1=a, x2=b, x3=c and y1=b+1, etc. We obtain a(1+b)+b(1+c)+c(1+a)≤a+b+c⋅(1+b)+(1+c)+(1+a)=1⋅4=2.
Source: MathNet,
licensed CC-BY-4.0.
Statement reproduced verbatim; metadata (topic, difficulty, ordering) added by this project.