Maths Olympiad Prep

Library / /512 of 520

Algebra Difficulty 8.0 Shortlist Find the answer

3. Let xi0(1in),i=1nxi=π,n2x_{i} \geqslant 0(1 \leqslant i \leqslant n), \sum_{i=1}^{n} x_{i}=\pi, n \geqslant 2. Find the maximum value of F=i=1nsin2xiF=\sum_{i=1}^{n} \sin ^{2} x_{i}.

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

Solution

3. When n=2n=2, x1+x2=π,F=sin2x1+sin2x2=2sin2x12x_{1}+x_{2}=\pi, F=\sin ^{2} x_{1}+\sin ^{2} x_{2}=2 \sin ^{2} x_{1} \leqslant 2. The equality holds when x1=x2=π2x_{1}=x_{2}=\frac{\pi}{2}. When n3n \geqslant 3, let x3,x4,,xnx_{3}, x_{4}, \cdots, x_{n} be constants, then x1+x2x_{1}+x_{2} is also a constant. Consider A=sin2x1+sin2x2,22A=12sin2x1+12sin2x2=A=\sin ^{2} x_{1}+\sin ^{2} x_{2}, 2-2 A=1-2 \sin ^{2} x_{1}+1-2 \sin ^{2} x_{2}= cos2x1+cos2x2=2cos(x1+x2)cos(x1x2)\cos 2 x_{1}+\cos 2 x_{2}=2 \cos \left(x_{1}+x_{2}\right) \cos \left(x_{1}-x_{2}\right). To find the smoothing tool, we examine the extremum of cos(x1x2)\cos \left(x_{1}-x_{2}\right) and the sign of cos(x1+x2)\cos \left(x_{1}+x_{2}\right). Note that when x1+x2π2x_{1}+x_{2} \leqslant \frac{\pi}{2}, cos(x1+x2)0\cos \left(x_{1}+x_{2}\right) \geqslant 0, and when x1+x2>π2x_{1}+x_{2}>\frac{\pi}{2}, cos(x1+x2)<0\cos \left(x_{1}+x_{2}\right)<0. When x1+x2>π2x_{1}+x_{2}>\frac{\pi}{2}, the smaller x1x2\left|x_{1}-x_{2}\right|, the larger AA. At this point, we need x1=x2x_{1}=x_{2}. The smoothing tool is (x1,x2)\left(x_{1}, x_{2}\right) \rightarrow (x1+x22,x1+x22)\left(\frac{x_{1}+x_{2}}{2}, \frac{x_{1}+x_{2}}{2}\right). To ensure the existence of x1x_{1} and x2x_{2} such that x1+x2π2x_{1}+x_{2} \leqslant \frac{\pi}{2}, a sufficient condition is n4n \geqslant 4. Thus, when n4n \geqslant 4, we can use the following smoothing tool. Lemma: If 0x1,x2π20 \leqslant x_{1}, x_{2} \leqslant \frac{\pi}{2}, and x1+x2π2x_{1}+x_{2} \leqslant \frac{\pi}{2}, then sin2x1+sin2x2sin2(x1+x2)\sin ^{2} x_{1}+\sin ^{2} x_{2} \leqslant \sin ^{2}\left(x_{1}+x_{2}\right). In fact, from 0x1,x2π20 \leqslant x_{1}, x_{2} \leqslant \frac{\pi}{2} and x1+x2π2x_{1}+x_{2} \leqslant \frac{\pi}{2}, we know that x1x2x1+x2π2\left|x_{1}-x_{2}\right| \leqslant\left|x_{1}+x_{2}\right| \leqslant \frac{\pi}{2}. Therefore, cos(x1x2)cos(x1+x2)\cos \left(x_{1}-x_{2}\right) \geqslant \cos \left(x_{1}+x_{2}\right), so 22(sin2x1+sin2x2)=cos2x1+cos2x2=2cos(x1+x2)cos(x1x2)2cos(x1+x2)cos(x1+x2)=2cos2(x1+x2)=2[1sin2(x1+x2)]=2-2\left(\sin ^{2} x_{1}+\sin ^{2} x_{2}\right)=\cos 2 x_{1}+\cos 2 x_{2}=2 \cos \left(x_{1}+x_{2}\right) \cos \left(x_{1}-x_{2}\right) \geqslant 2 \cos \left(x_{1}+x_{2}\right) \cos \left(x_{1}+x_{2}\right)=2 \cos ^{2}\left(x_{1}+x_{2}\right)=2\left[1-\sin ^{2}\left(x_{1}+x_{2}\right)\right]= 22sin2(x1+x2)2-2 \sin ^{2}\left(x_{1}+x_{2}\right), rearranging, the lemma is proved. We now discuss the cases. When n=3n=3, if the three angles are (π2,π2,0)\left(\frac{\pi}{2}, \frac{\pi}{2}, 0\right), then adjusting to (π2,π4,π4)\left(\frac{\pi}{2}, \frac{\pi}{4}, \frac{\pi}{4}\right), the value of FF increases from 2 to 1+21+\sqrt{2}, so we can assume x1x2x3x_{1} \leqslant x_{2} \leqslant x_{3}, and (x1,x2,x3)(0,π2,π2)\left(x_{1}, x_{2}, x_{3}\right) \neq\left(0, \frac{\pi}{2}, \frac{\pi}{2}\right). Then x2>π2x_{2}>\frac{\pi}{2}, x1π3x3x_{1} \leqslant \frac{\pi}{3} \leqslant x_{3}. Smoothing (x1,x2,x3)\left(x_{1}, x_{2}, x_{3}\right) to (π3,x2,x1+x3π3)\left(\frac{\pi}{3}, x_{2}, x_{1}+x_{3}-\frac{\pi}{3}\right), by the above discussion, FF increases. Another smoothing transformation yields (π3,π3,π3)\left(\frac{\pi}{3}, \frac{\pi}{3}, \frac{\pi}{3}\right), so F94F \leqslant \frac{9}{4}. When n4n \geqslant 4, assume x1x2xn1xnx_{1} \geqslant x_{2} \geqslant \cdots \geqslant x_{n-1} \geqslant x_{n}, then there must be two angles: xn1+xnπ2x_{n-1}+x_{n} \leqslant \frac{\pi}{2}. By the lemma, F=sin2x1++sin2xn1+sin2xnsin2x1+sin2x2++sin2(xn1+xn)=F=\sin ^{2} x_{1}+\cdots+\sin ^{2} x_{n-1}+\sin ^{2} x_{n} \geqslant \sin ^{2} x_{1}+\sin ^{2} x_{2}+\cdots+\sin ^{2}\left(x_{n-1}+x_{n}\right)= sin2x1++sin2xn2+sin2xn1\sin ^{2} x_{1}^{\prime}+\cdots+\sin ^{2} x_{n-2}^{\prime}+\sin ^{2} x_{n-1}^{\prime} (where x1,x2,,xn2,xn1x_{1}^{\prime}, x_{2}^{\prime}, \cdots, x_{n-2}^{\prime}, x_{n-1}^{\prime} are x1x_{1}, x2,,xn2,xn1+xnx_{2}, \cdots, x_{n-2}, x_{n-1}+x_{n} in descending order). If n14n-1 \geqslant 4, then there must be two angles: xn2+xn1π2x_{n-2}^{\prime}+x_{n-1}^{\prime} \leqslant \frac{\pi}{2}. Continue using the lemma for the above transformation, at most n3n-3 times, the variable set can be transformed into (x1,x2,x3,0,0,,0)\left(x_{1}^{\prime}, x_{2}^{\prime}, x_{3}^{\prime}, 0,0, \cdots, 0\right). Using the result when n=3n=3, we know that F94F \leqslant \frac{9}{4}, the equality holds when x1=x2=x3=π3,x4=x5==xn=0x_{1}=x_{2}=x_{3}=\frac{\pi}{3}, x_{4}=x_{5}=\cdots=x_{n}=0. Therefore, when n=2n=2, the maximum value of FF is 2; when n>2n>2, the maximum value of FF is 94\frac{9}{4}.

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.