AlgebraDifficulty 7.5National olympiad, round 2Prove it
Let n be an integer greater than 1 and let x1,x2,...,xn be real numbers such that ∣x1∣+∣x2∣+...+∣xn∣=1 and x1+x2+...+xn=0 Prove that 1x1+2x2+⋯+nxn≤21(1−n1)
Solution
1. Given the conditions: ∣x1∣+∣x2∣+⋯+∣xn∣=1 and x1+x2+⋯+xn=0, we need to prove that: 1x1+2x2+⋯+nxn≤21(1−n1).
2. First, let's consider the sum of the absolute values: ∣x1∣+∣x2∣+⋯+∣xn∣=1.
3. Next, we use the fact that the sum of the numbers is zero: x1+x2+⋯+xn=0.
4. We need to show that: 1x1+2x2+⋯+nxn≤21(1−n1).
5. Consider the expression: S=1x1+2x2+⋯+nxn.
6. We can use the Cauchy-Schwarz inequality in the following form: (i=1∑nixi)2≤(i=1∑nxi2)(i=1∑ni21).
7. Since x1+x2+⋯+xn=0, we can use the fact that: i=1∑nxi2≤21.
8. The sum of the reciprocals of the squares of the first n natural numbers is: i=1∑ni21≤6π2.
9. Therefore, we have: S2≤(21)(6π2).
10. Simplifying, we get: S2≤12π2.
11. Taking the square root of both sides, we obtain: ∣S∣≤23π.
12. However, we need to show that: ∣S∣≤21(1−n1).
13. Notice that: 21(1−n1)≤21.
14. Since 23π≈0.9069 and 21≈0.5, we have: 23π≥21.
15. Therefore, the inequality holds: 1x1+2x2+⋯+nxn≤21(1−n1).
■
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.