Find the maximum value of k such that: for all a,b,c are sidelengths of some triangle, then k⋅(a+b+c)23(a2+b2+c2)+a2+b2+c2ab+bc+ca≤k+1.
Solution
The given inequality can be written as 2k⋅(a+b+c)2(a2+b2+c2)−(ab+bc+ca)≤a2+b2+c2a2+b2+c2−ab+bc+ca 2k⋅(a+b+c)2(a2+b2+c2)−(ab+bc+ca)≤a2+b2+c2((a2+b2+c2)+(ab+bc+ca))(a2+b2+c2)−(ab+bc+ca). Note that (a2+b2+c2)−(ab+bc+ca)=21[(a−b)2+(b−c)2+(c−a)2]≥0 so 2ka2+b2+c2(a2+b2+c2+ab+bc+ca)≤(a+b+c)2. Consider a=b=1 and c→0+ (isosceles triangle with the base arbitrary small) then LHS→2k⋅2(2+1) and RHS→4. Thus k≤22(2+1)4=2−2. For k=2−2 then we need to prove that (4−22)a2+b2+c2(a2+b2+c2+ab+bc+ca)≤(a+b+c)2. Denote x=a2+b2+c2 and y=ab+bc+ca then the above can be written as (4−22)x(x+y)≤x2+2y2 x2+2(2+2)xy−(2+2)2y2≤0. This equivalent to x≤y2 or a2+b2+c2≤2(ab+bc+ca). The last inequality is true for a,b,c are sidelengths of triangle since it can be written as a(b+c−a)+b(c+a−b)+c(a+b−c)≥0. Hence, kmax=2−2.
Want a route through all this instead of an archive? The track
puts 2,000 problems in a working order, from AMC 10 level to the IMO shortlist.
Source: MathNet,
licensed CC-BY-4.0.
Statement and solution reproduced as published; topic and difficulty added by this site.