Example 7 Let n∈N,x0=0,xi>0,i=1,2,⋯,n, and ∑i=1nxi=1. Prove: 1⩽i=1∑n1+x0+x1+⋯+xi−1⋅xi+xi+1+⋯+xnxi<2π.
Solution
Prove that because ∑i=1nxi=1, so, by the AM-GM inequality, we have (1+x0+x1+⋯+xi−1)(xi+xi+1+⋯+xn)⩽21+x0+x1+⋯+xn=1.
Thus, ∑i=1n1+x0+x1+⋯+xi−1⋅xi+xi+1+⋯+xnxi⩾∑i=1nxi=1. That is, the left inequality we need to prove holds. Since 0⩽x0+x1+⋯+xi⩽1,i=1,2,⋯,n, we can let θi=arcsin(x0+x1+⋯+xi),i=1,2,⋯,n. Then, θi∈[0,2π], and we have 0=θ0<θ1<⋯<θn=2π, thus, we have xi=sinθi−sinθi−1=2cos2θi+θi−1⋅sin2θi−θi−1<2cosθi−1⋅sin2θi−θi−1. Since, for x∈[0,2π], we have sinx<x, so we have xi<2cosθi−1⋅2θi−θi−1=(θi−θi−1)⋅cosθi−1,
Therefore, cosθi−1xi<θi−θi−1,i=1,2,⋯,n. Summing both sides of the above inequality from i=1 to n, we get i=1∑ncosθi−1xi<θn−θ0=2π.
By the definition of θi, we know sinθi=x1+x2+⋯+xi, so cosθi−1=1−sin2θi−1=1−(x0+x1+x2+⋯+xi−1)2 =(1+x0+x1+⋯+xi−1)(xi+xi+1+⋯+xn).
Substituting (2) into (1), we obtain the right inequality we need to prove.
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.