15 Let a,b,c∈(0,1], and a2+b2+c2=2. Prove: a1−b2+b1−c2+c1−a2⩽45.
Solution
Proof: Without loss of generality, let a=max{a,b,c}. From the given condition, we have a2⩽b2+c2. Then (1) ⇔2a2−2b2+2b2−2c2+2c2−2a2⩽45⇔2aa2+c2−b2+2ba2+b2−c2+2cb2+c2−a2⩽45.
And 45=4521(a2+b2+c2)⩾45⋅21(a+b2+c2),
Therefore, it suffices to prove ⩽⇔⩽⇔⩽⇔⩽⇔aa2+c2−b2+ba2+b2−c2+cb2+c2−a245(a+b2+c2).abcbc(a2+c2−b2)+ca(a2+b2−c2)+ab(b2+c2−a2)45(a+b2+c2)a+b+c+abc(a+b+c)(a−b)(b−c)(c−a)45(a+b2+c2)4(a+b+c)[abc+(a−b)(b−c)(c−a)]5abc(a+b2+c2)4(a+b+c)(a−b)(a−c)(c−b)+abc(4(b+c)−a−5b2+c2)⩽0. Let f(a)=4(a+b+c)(a−b)(a−c)(c−b)+abc(4(b+c)−a−5b2+c2). (i) If b⩽c⩽a⩽b2+c2. When b=c, a⩽2b. At this time, f(a)=ab2(8b−a−52b)=ab2((7−52)b+(b−a))⩽0, hence lima→−∞f(a)⩽0, and f(0)=4(b+c)bc(c−b)>0, f(c)=bc2(4(b+c)−c−5b2+c2)=bc2(4b+3c−5b2+c2)⩽0⇔(3b−4c)2>0. Therefore, f(a) has three real roots in (−∞,0), (0,c), and (c,+∞).
Consider the sign of f(b2+c2), noting that the sign of f(a) is the same as the sign of the left side minus the right side in (3). We only need to consider aa2+c2−b2+ba2+b2−c2+cb2+c2−a2−45(a+b2+c2)
when a=b2+c2. At this time, (4) =b2+c22c2+b2b2−45(b2+c2+b2+c2)=b2+c22c2+2b−25b2+c2=2b2+c21(4c2+4bb2+c2−5(b2+c2))=2b2+c21(4bb2+c2−5b2−c2)⩽0 (⇔4bb2+c2⩽5b2+c2⇔16b4+16b2c2⩽25b4+c4+10b2c2⇔9b4+c4−6b2c2⩾0⇔(3b2−c2)2⩾0).
From the above, we know that f(b2+c2)⩽0. This indicates that when c⩽a⩽b2+c2, f(a)⩽0. (ii) If c<b⩽a⩽b2+c2, then a>c and a>b, so ⩾4(a+b+c)(a−c)(a−b)(b−c)⩾04(a+b+c)(a−c)(a−b)(c−b),
Therefore, when b⩽a⩽b2+c2, f(a)⩽4(a+b+c)(a−c)(a−b)(b−c)+abc(4(b+c)−a−5b2+c2)⩽0. (a=1,b=21,c=23 when equality holds. )
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: NuminaMath-1.5,
licensed Apache-2.0.
Statement and solution reproduced as published; topic and difficulty added by this site.