Prove that for all positive integers n and all real numbers x1,x2,…,xn the inequality x12+1+2x22+1+⋯+nxn2+1≥(x1+2x2+⋯+nxn)2+4n2(n+1)2 holds.
Solution
We prove the inequality by induction. Obviously, for n=1 the equality holds and for n=2 we have x12+1+2x22+1≥(x1+2x2)2+9. After squaring both sides we rewrite it as (x12+1)(x22+1)≥x1x2+1. If the right-hand side is negative, then the inequality holds, if not, we can square both sides and transform it into (x1−x2)2≥0, which is true. So, for n=2 the inequality holds.
Let us assume the inequality holds for n and prove it for n+1. By induction hypothesis we have x12+1+2x22+1+⋯+nxn2+1≥(x1+2x2+⋯+nxn)2+4n2(n+1)2, so it suffices to show that (x1+2x2+⋯+nxn)2+4n2(n+1)2+(n+1)xn+12+1≥≥(x1+2x2+⋯+nxn+(n+1)xn+1)2+4(n+1)2(n+2)2. This is equivalent to (x1+2x2+⋯+nxn)2+4n2(n+1)2+(n+1)2xn+12+(n+1)2++2(n+1)(x1+2x2+⋯+nxn)2+4n2(n+1)2xn+12+1≥≥(x1+2x2+⋯+nxn)2+(n+1)2xn+12+2(n+1)xn+1(x1+2x2+⋯+nxn)++4(n+1)2(n+2)2, and further to 2(x1+2x2+⋯+nxn)2+4n2(n+1)2xn+12+1≥2xn+1(x1+2x2+⋯+nxn)+n(n+1). If the right-hand side is negative, then the inequality holds. If not, we can square both sides and we get 4(x1+2x2+⋯+nxn)2xn+12+4(x1+2x2+⋯+nxn)2+n2(n+1)2xn+12+n2(n+1)2≥4xn+12(x1+2x2+⋯+nxn)2+n2(n+1)2+4n(n+1)xn+1(x1+2x2+⋯+nxn) and finally (2(x1+2x2+⋯+nxn)−n(n+1)xn+1)2≥0. This inequality obviously holds, and the equality holds when xn+1=n(n+1)2(x1+2x2+⋯+nxn). By induction, the equality holds when x1=x2=⋯=xn=xn+1.
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: MathNet,
licensed CC-BY-4.0.
Statement and solution reproduced as published; topic and difficulty added by this site.