Let a, b, c be distinct positive integers and let k be a positive integer such that ab+bc+ca≥3k2−1. Prove that 31(a3+b3+c3)≥abc+3k.
Solution
The desired inequality is equivalent to a3+b3+c3−3abc≥9k. We have a3+b3+c3−3abc=(a+b+c)(a2+b2+c2−ab−bc−ca). Integers ∣a−b∣, ∣b−c∣ and ∣c−a∣ can not all be equal 1 so a2+b2+c2−ab−bc−ca=21((a−b)2+(b−c)2+(c−a)2)≥21(12+12+22)=3.
It follows that a3+b3+c3−3abc≥3(a+b+c). Since (a+b+c)2=a2+b2+c2+2ab+2bc+2ac=(a2+b2+c2−ab−bc−ac)+3(ab+bc+ac)≥3+3(3k2−1)=9k2 it follows that a+b+c≥3k so a3+b3+c3−3abc≥9k.
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.