Maths Olympiad Prep

Library / /32 of 520

Algebra Difficulty 5.7 AIME, harder Prove it

Corollary 2. Suppose that x1,x2,,xnx_{1}, x_{2}, \ldots, x_{n} are non-negative real numbers satisfying
x1+x2++xn=const,x12+x22++xn2=constx_{1}+x_{2}+\ldots+x_{n}=\text{const}, x_{1}^{2}+x_{2}^{2}+\ldots+x_{n}^{2}=\text{const}
and f(x1,x2,,xn)f\left(x_{1}, x_{2}, \ldots, x_{n}\right) a continuous, symmetric, under-limitary function satisfying that, if x1x2xnx_{1} \geq x_{2} \geq \ldots \geq x_{n} and x2,x3,,xn2x_{2}, x_{3}, \ldots, x_{n-2} are fixed then f(x1,x2,,xn)=g(x1,xn1,xn)f\left(x_{1}, x_{2}, \ldots, x_{n}\right)=g\left(x_{1}, x_{n-1}, x_{n}\right) is a strictly increasing function of x1xn1xnx_{1} x_{n-1} x_{n}; then f(x1,x2,,xn)f\left(x_{1}, x_{2}, \ldots, x_{n}\right) attains the minimum value if and only if x1=x2==xk=0<xk+1xk+2==xnx_{1}=x_{2}=\ldots=x_{k}=0<x_{k+1} \leq x_{k+2}=\ldots=x_{n}, where kk is a certain natural number and k<nk<n. If x1x2xnx_{1} \geq x_{2} \geq \ldots \geq x_{n} and x3,,xn1x_{3}, \ldots, x_{n-1} are fixed then f(x1,x2,,xn)=g(x1,x2,xn)f\left(x_{1}, x_{2}, \ldots, x_{n}\right)=g\left(x_{1}, x_{2}, x_{n}\right) is a strictly increasing function of x1x2xnx_{1} x_{2} x_{n}; then f(x1,x2,,xn)f\left(x_{1}, x_{2}, \ldots, x_{n}\right) attains the maximum value if and only if x1=x2==xn1xnx_{1}=x_{2}=\ldots=x_{n-1} \leq x_{n}.

Proof. To prove the above corollaries, we only show the hardest, that is the second part of the second corollary (and other parts are proved similarly).

Solution

None

Translate the text above into English, please retain the original text's line breaks and format, and output the translation result directly.

Note: The provided instruction is a meta-instruction and not part of the text to be translated. Since the text to be translated is "None", the translation is also "None". Here is the formatted output as requested:

None

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.