3. Let xi⩾0(1⩽i⩽n),∑i=1nxi=π,n⩾2. Find the maximum value of F=∑i=1nsin2xi.
A number or a short expression. Spacing and $ signs are ignored.
Solution
3. When n=2, x1+x2=π,F=sin2x1+sin2x2=2sin2x1⩽2. The equality holds when x1=x2=2π. When n⩾3, let x3,x4,⋯,xn be constants, then x1+x2 is also a constant. Consider A=sin2x1+sin2x2,2−2A=1−2sin2x1+1−2sin2x2=cos2x1+cos2x2=2cos(x1+x2)cos(x1−x2). To find the smoothing tool, we examine the extremum of cos(x1−x2) and the sign of cos(x1+x2). Note that when x1+x2⩽2π, cos(x1+x2)⩾0, and when x1+x2>2π, cos(x1+x2)<0. When x1+x2>2π, the smaller ∣x1−x2∣, the larger A. At this point, we need x1=x2. The smoothing tool is (x1,x2)→(2x1+x2,2x1+x2). To ensure the existence of x1 and x2 such that x1+x2⩽2π, a sufficient condition is n⩾4. Thus, when n⩾4, we can use the following smoothing tool. Lemma: If 0⩽x1,x2⩽2π, and x1+x2⩽2π, then sin2x1+sin2x2⩽sin2(x1+x2). In fact, from 0⩽x1,x2⩽2π and x1+x2⩽2π, we know that ∣x1−x2∣⩽∣x1+x2∣⩽2π. Therefore, cos(x1−x2)⩾cos(x1+x2), so 2−2(sin2x1+sin2x2)=cos2x1+cos2x2=2cos(x1+x2)cos(x1−x2)⩾2cos(x1+x2)cos(x1+x2)=2cos2(x1+x2)=2[1−sin2(x1+x2)]=2−2sin2(x1+x2), rearranging, the lemma is proved. We now discuss the cases. When n=3, if the three angles are (2π,2π,0), then adjusting to (2π,4π,4π), the value of F increases from 2 to 1+2, so we can assume x1⩽x2⩽x3, and (x1,x2,x3)=(0,2π,2π). Then x2>2π, x1⩽3π⩽x3. Smoothing (x1,x2,x3) to (3π,x2,x1+x3−3π), by the above discussion, F increases. Another smoothing transformation yields (3π,3π,3π), so F⩽49. When n⩾4, assume x1⩾x2⩾⋯⩾xn−1⩾xn, then there must be two angles: xn−1+xn⩽2π. By the lemma, F=sin2x1+⋯+sin2xn−1+sin2xn⩾sin2x1+sin2x2+⋯+sin2(xn−1+xn)=sin2x1′+⋯+sin2xn−2′+sin2xn−1′ (where x1′,x2′,⋯,xn−2′,xn−1′ are x1, x2,⋯,xn−2,xn−1+xn in descending order). If n−1⩾4, then there must be two angles: xn−2′+xn−1′⩽2π. Continue using the lemma for the above transformation, at most n−3 times, the variable set can be transformed into (x1′,x2′,x3′,0,0,⋯,0). Using the result when n=3, we know that F⩽49, the equality holds when x1=x2=x3=3π,x4=x5=⋯=xn=0. Therefore, when n=2, the maximum value of F is 2; when n>2, the maximum value of F is 49.
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.