Maths Olympiad Prep

Library / /299 of 520

Algebra Difficulty 6.8 National olympiad Prove it

12. Let a,b,ca, b, c be non-negative numbers, no two of which are zero. Then
1a2+ab+b2+1b2+bc+c2+1c2+ca+a29(a+b+c)2\frac{1}{a^{2}+a b+b^{2}}+\frac{1}{b^{2}+b c+c^{2}}+\frac{1}{c^{2}+c a+a^{2}} \geqslant \frac{9}{(a+b+c)^{2}}

Solution

12. (2007.02.25) Proof: Take a point PP on the plane, and draw line segments PA=aP A=a, PB=bP B=b, PC=cP C=c, such that the angles from ray PAP A to PBP B, PBP B to PCP C, and PCP C to PAP A are all 120120^{\circ}. Connect AA, BB, and CC to form ABC\triangle A B C, and denote BC=aB C=a^{\prime}, CA=bC A=b^{\prime}, AB=cA B=c^{\prime}. Then the original inequality is equivalent to
(PA)21a29\left(\sum P A\right)^{2} \cdot \sum \frac{1}{a^{\prime 2}} \geqslant 9

Since
(PA)22bca2\left(\sum P A\right)^{2} \geqslant 2 \sum b^{\prime} c^{\prime}-\sum a^{\prime 2}
(see Liu Jian, Generalization and Application of Bottema's Inequality, Fujian Middle School Mathematics, 1994, No. 1, 810), it suffices to prove
(2bca2)1a29\left(2 \sum b^{\prime} c^{\prime}-\sum a^{\prime 2}\right) \cdot \sum \frac{1}{a^{\prime 2}} \geqslant 9

This is a known inequality.

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.