BdMO Online Forum

can we use anything else than "the helpful inequality"

for $x_{1},x_{2},x_{3},\cdot \cdot \cdot x_{n}$ positive integers, prove that


\[(\frac{x_{1}^{2}+x_{2}^{2}+\cdot \cdot \cdot +x_{n}^{2}}{x_{1}+x_{2}+\cdot \cdot \cdot +x_{n}})^{\frac{kn}{t}}\geq x_{1}\cdot x_{2}\cdot \cdot \cdot \cdot \cdot x_{n}\],

where $k=$ max {${{x_{1}, x_{2},\cdot \cdot \cdot ,x_{n}}}$} and $t=$ min {${{x_{1}, x_{2}, \cdot \cdot \cdot, x_{n}}}$}.
under which conditions the equality holds?

In fact you can use Cauchy or QM-AM inequalities to simplify this problem. Then solve the last part as you please.

But, as far as i proved,

\[(\frac{\sum_{i=1}^{n} x_i^2}{\sum_{i=1}^{n} x_i})^n \geq x_1\cdot \cdot x_n\]

but, how raise the power $\frac{k}{t}$?