Problem: Let a, b, c be positive real numbers such that abc=1. Show that a3+bc1+b3+ca1+c3+ab1≤6(ab+bc+ca)2
Solution
Solution: By the AM-GM inequality we have a3+bc≥2a3bc=2a2(abc)=2a and a3+bc1≤2a1 Similarly, b3+ca1≤2b1, c3+ab1≤2c1, and then a3+bc1+b3+ca1+c3+ab1≤2a1+2b1+2c1=21abcab+bc+ca≤6(ab+bc+ca)2 Therefore, it is enough to prove 6(ab+bc+ca)2≤6(ab+bc+ca)2. This inequality is trivially shown to be equivalent to 3≤ab+bc+ca, which is true because of the AM-GM inequality: 3=3(abc)2≤ab+bc+ca.
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.