Maths Olympiad Prep

Library / /225 of 520

Algebra Difficulty 5.1 AIME, harder Find the answer

Example 5 Let nN+,a1,a2,,ann \in \mathbf{N}_{+}, a_{1}, a_{2}, \cdots, a_{n} and b1,b2,,bnb_{1}, b_{2}, \cdots, b_{n} be positive real numbers, and i=1nai=1,i=1nbi=1\sum_{i=1}^{n} a_{i}=1, \sum_{i=1}^{n} b_{i}=1. Find the minimum value of i=1nai2ai+bi\sum_{i=1}^{n} \frac{a_{i}^{2}}{a_{i}+b_{i}}.
(2004, French Team Selection Exam)

A number or a short expression. Spacing and $ signs are ignored.

Solution

Solution: By Cauchy-Schwarz inequality, we have
(i=1nai+i=1nbi)(i=1nai2ai+bi)[i=1naiai+biai+bi]2=(i=1nai)2=1. Then i=1nai2ai+bi12. \begin{array}{l} \left(\sum_{i=1}^{n} a_{i}+\sum_{i=1}^{n} b_{i}\right)\left(\sum_{i=1}^{n} \frac{a_{i}^{2}}{a_{i}+b_{i}}\right) \\ \geqslant\left[\sum_{i=1}^{n} \frac{a_{i}}{\sqrt{a_{i}+b_{i}}} \sqrt{a_{i}+b_{i}}\right]^{2} \\ =\left(\sum_{i=1}^{n} a_{i}\right)^{2}=1 . \\ \text { Then } \sum_{i=1}^{n} \frac{a_{i}^{2}}{a_{i}+b_{i}} \geqslant \frac{1}{2} . \end{array}
 When a1=a2==an=b1==bn=1n \text { When } a_{1}=a_{2}=\cdots=a_{n}=b_{1}=\cdots=b_{n}=\frac{1}{n}

the equality holds, at this time, i=1nai2ai+bi\sum_{i=1}^{n} \frac{a_{i}^{2}}{a_{i}+b_{i}} takes the minimum value 12\frac{1}{2}.

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.