Determine the largest real number k such that the inequality (k+ba)(k+cb)(k+ac)≤(ba+cb+ac)(ab+bc+ca) holds for all positive real numbers a, b, and c.
Solution
By setting a=b=c, it follows that k≤39−1. We claim that k=39−1 is the largest possible number so that the inequality holds. Let A=ba+cb+ac,B=ab+bc+ca. By AM-GM inequality, we get that A≥33ba⋅cb⋅ac=3, and similarly, B≥33ab⋅bc⋅ca=3. For each real number k≥0, the following inequalities are true: 9(k3+1)≤(k3+1)AB 9k2A≤3k2AB 9kB≤3kAB.
Adding these inequalities we get 9(k3+1+k2A+kB)≤(k+1)3AB9(k+ba)(k+cb)(k+ac)≤(k+1)3AB. Substituting k=39−1 in the last inequality, we discover that 9(k+ba)(k+cb)(k+ac)≤9AB. which is precisely, the desired inequality. Therefore the largest possible k is 39−1 as claimed. □
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.