Maths Olympiad Prep

Library / /411 of 520

Algebra Difficulty 7.3 National olympiad, round 2 Prove it

Example 2 Let xi>0,xiyizi2>0(i=1,2,,n)x_{i}>0, x_{i} y_{i}-z_{i}^{2}>0(i=1,2, \cdots, n), then
n3i=1nxii=1nyi(i=1nzi)2i=1n1xiyizi2\frac{n^{3}}{\sum_{i=1}^{n} x_{i} \sum_{i=1}^{n} y_{i}-\left(\sum_{i=1}^{n} z_{i}\right)^{2}} \leqslant \sum_{i=1}^{n} \frac{1}{x_{i} y_{i}-z_{i}^{2}}

holds. Equality occurs if and only if x1=x2==xn;y1=y2==yn;z1=z2=x_{1}=x_{2}=\cdots=x_{n} ; y_{1}=y_{2}=\cdots=y_{n} ; z_{1}=z_{2}= =zn\cdots=z_{n}. (This is a generalization of a problem from the 11th IMO (n=2(n=2))

Solution

Let Ai=xiyi+zi,Bi=xiyizi(i=1,2,,n) A_{i}=\sqrt{x_{i} y_{i}}+z_{i}, B_{i}=\sqrt{x_{i} y_{i}}-z_{i} (i=1,2, \cdots, n) . Using the Cauchy-Schwarz inequality and its generalization, we have:
[i=1nxii=1nyi(i=1nzi)2]i=1n1xiyizi2[(i=1nxiyi)2(i=1nzi)2]i=1n1(xiyi)2zi2=i=1n(xiyi+zi)i=1n(xiyizi)i=1n1(xiyi+zi)(xiyizi)=i=1nAii=1nBii=1n1AiBi(i=1nAi3Bi31AiBi3)3=(i=1n1)3=n3 \begin{aligned} & \left[\sum_{i=1}^{n} x_{i} \cdot \sum_{i=1}^{n} y_{i}-\left(\sum_{i=1}^{n} z_{i}\right)^{2}\right] \cdot \sum_{i=1}^{n} \frac{1}{x_{i} y_{i}-z_{i}^{2}} \\ \geqslant & \left[\left(\sum_{i=1}^{n} \sqrt{x_{i} y_{i}}\right)^{2}-\left(\sum_{i=1}^{n} z_{i}\right)^{2}\right] \cdot \sum_{i=1}^{n} \frac{1}{\left(\sqrt{x_{i} y_{i}}\right)^{2}-z_{i}^{2}} \\ = & \sum_{i=1}^{n}\left(\sqrt{x_{i} y_{i}}+z_{i}\right) \cdot \sum_{i=1}^{n}\left(\sqrt{x_{i} y_{i}}-z_{i}\right) \cdot \\ & \sum_{i=1}^{n} \frac{1}{\left(\sqrt{x_{i} y_{i}}+z_{i}\right)\left(\sqrt{x_{i} y_{i}}-z_{i}\right)} \\ = & \sum_{i=1}^{n} A_{i} \cdot \sum_{i=1}^{n} B_{i} \cdot \sum_{i=1}^{n} \frac{1}{A_{i} B_{i}} \\ \geqslant & \left(\sum_{i=1}^{n} \sqrt[3]{A_{i}} \cdot \sqrt[3]{B_{i}} \cdot \sqrt[3]{\frac{1}{A_{i} B_{i}}}\right)^{3}=\left(\sum_{i=1}^{n} 1\right)^{3}=n^{3} \end{aligned}
Thus, the original inequality holds.

According to the proof of the generalized Cauchy-Schwarz inequality, the condition for the original inequality to hold is A1=A2==An A_{1}=A_{2}=\cdots=A_{n} ; B1=B2==Bn B_{1}=B_{2}=\cdots=B_{n} ; x1=x2==xn x_{1}=x_{2}=\cdots=x_{n} ; y1=y2==yn y_{1}=y_{2}=\cdots=y_{n} , i.e., when x1=x2==xn x_{1}=x_{2}=\cdots=x_{n} ; y1=y2==yn y_{1}=y_{2}=\cdots=y_{n} and z1=z2==zn z_{1}=z_{2}=\cdots=z_{n} .

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.