Real numbers a and b satisfy a3+b3−6ab=−11. Prove that −37<a+b<−2.
Solutions — 2
Solution 1
Solution:
Using the identity x3+y3+z3−3xyz=21(x+y+z)((x−y)2+(y−z)2+(z−x)2) we get −3=a3+b3+23−6ab=21(a+b+2)((a−b)2+(a−2)2+(b−2)2) Since S=(a−b)2+(a−2)2+(b−2)2 must be positive, we conclude that a+b+2<0, i.e. that a+b<−2. Now S can be bounded by S⩾(a−2)2+(b−2)2=a2+b2−4(a+b)+8⩾2(a+b)2−4(a+b)+8>18 Here, we have used the fact that a+b<−2, which we have proved earlier. Since a+b+2 is negative, it immediately implies that a+b+2<−182⋅3=−31, i.e. a+b<−37 which we wanted.
Solution 2
Solution:
Writing s=a+b and p=ab we have a3+b3−6ab=(a+b)(a2−ab+b2)−6ab=s(s2−3p)−6p=s3−3ps−6p This gives 3p(s+2)=s3+11. Thus s=−2 and using the fact that s2⩾4p we get p=3(s+2)s3+11⩽4s2 If s>−2, then (1) gives s3−6s2+44⩽0. This is impossible as s3−6s2+44=(s+2)(s−4)2+8>0 So s<−2. Then from (1) we get s3−6s2+44⩾0. If s<−37 this is again impossible as s3−6s2=s2(s−6)<−949⋅325<−44. (Since 49⋅25=1225>1188=44⋅27.) So −37<s<−2 as required.
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 reproduced verbatim; metadata (topic, difficulty) added by this project.