Maths Olympiad Prep

Library / /509 of 520

Algebra Difficulty 6.0 National olympiad Prove it

Let a,b,ca, b, c be positive numbers, and \sum denote the cyclic sum over the relevant quantities. Then for n1n \geqslant 1 we have
anbn+cnan1bn1+cn1,an+1bn+cnanbn1+cn1. \begin{array}{l} \sum \frac{a^{n}}{b^{n}+c^{n}} \geqslant \sum \frac{a^{n-1}}{b^{n-1}+c^{n-1}}, \\ \sum \frac{a^{n+1}}{b^{n}+c^{n}} \geqslant \sum \frac{a^{n}}{b^{n-1}+c^{n-1}} . \end{array}

Solution

Proof: (1) Without loss of generality, let abca \geqslant b \geqslant c, then it is easy to prove
anbn1+ancn1an1bnan1cn0,ancn1an1cn+bncn1bn1cn0, \begin{array}{l} a^{n} b^{n-1}+a^{n} c^{n-1}-a^{n-1} b^{n}-a^{n-1} c^{n} \geqslant 0, \\ a^{n} c^{n-1}-a^{n-1} c^{n}+b^{n} c^{n-1}-b^{n-1} c^{n} \geqslant 0, \end{array}

and
+bnan1+bncn1bn1anbn1cn(an+cn)(an1+cn1)anbn1+ancn1an1bnan1cn(an+cn)(an1+cn1)+bnan1+bncn1bn1anbn1cn(an+cn)(an1+cn1)=ancn1an1cn+bncn1bn1cn(an+cn)(an1+cn1)ancn1an1cn+bncn1bn1cn(an+bn)(an1+bn1)=cn1an1+bn1cnan+bn \begin{array}{l} +\frac{b^{n} a^{n-1}+b^{n} c^{n-1}-b^{n-1} a^{n}-b^{n-1} c^{n}}{\left(a^{n}+c^{n}\right)\left(a^{n-1}+c^{n-1}\right)} \\ \geqslant \frac{a^{n} b^{n-1}+a^{n} c^{n-1}-a^{n-1} b^{n}-a^{n-1} c^{n}}{\left(a^{n}+c^{n}\right)\left(a^{n-1}+c^{n-1}\right)} \\ +\frac{b^{n} a^{n-1}+b^{n} c^{n-1}-b^{n-1} a^{n}-b^{n-1} c^{n}}{\left(a^{n}+c^{n}\right)\left(a^{n-1}+c^{n-1}\right)} \\ =\frac{a^{n} c^{n-1}-a^{n-1} c^{n}+b^{n} c^{n-1}-b^{n-1} c^{n}}{\left(a^{n}+c^{n}\right)\left(a^{n-1}+c^{n-1}\right)} \\ \geqslant \frac{a^{n} c^{n-1}-a^{n-1} c^{n}+b^{n} c^{n-1}-b^{n-1} c^{n}}{\left(a^{n}+b^{n}\right)\left(a^{n-1}+b^{n-1}\right)} \\ =\frac{c^{n-1}}{a^{n-1}+b^{n-1}}-\frac{c^{n}}{a^{n}+b^{n}} \text {. } \\ \end{array}

At this point, inequality (1) holds.
(2) The proof of inequality (2) is extremely similar to that of inequality (1), and is omitted.

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.