4. Prove that for any α⩽1 and any real numbers x1,x2,⋯,xn satisfying 1⩾x1⩾x2⩾⋯⩾xn>0, we have (1+x1+x2+⋯+xn)α⩽1+1α−1x1α+2α−1x2α+⋯+nα−1xnα.
This one wants a proof. Work it on paper, read the official solution, then mark
yourself honestly — the ladder only means something if the record is true.
Official solution
4. When n=F, (1+x1)α⩽1+x1α (this can be obtained by using the fact that f(x)=(1+x)α−(1+xα) is a decreasing function on (0,1)), the inequality holds. Assume the inequality holds for n, we will prove it also holds for n+1. We have (1+xF+x2+⋯+xn+xn+1)α−(F+x1+x2+⋯+xn)α=(1+x1+x2+⋯+xn)α[(F+1+x1+x2+⋯+xn)α−F]⩽(1+x1+x2+⋯+xn)αxn+1⩽((n+1)xn+1)α−1xn+1=(n+1)α−1xn+1α
The inequality (1+x1+x2+⋯+xn)α−1xn+1⩽((n+1)n+1)α−1xn+1 is valid by the condition 1+x1+x2+⋯+xn⩾(n+1)xn+1 and α−1⩽0. By the proven inequality and the induction hypothesis, we get (1+x1+x2+⋯+xn+xn+1)α⩽(1+x1+x2+⋯+xn)α+(−n+1)α−1xn+1α⩽1+1α−1x1α+2α−1x2α+⋯+nα−1xnα+(n+1)α−1xn+1α
This is what we need to prove.
Source: NuminaMath-1.5,
licensed Apache-2.0.
Statement and solution reproduced as published; topic, difficulty and ordering added
by this site.