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?
exercise 1.108 (Greece 2008) [BOMC]
- nafistiham
- Posts:829
- Joined:Mon Oct 17, 2011 3:56 pm
- Location:24.758613,90.400161
- Contact:
\[\sum_{k=0}^{n-1}e^{\frac{2 \pi i k}{n}}=0\]
Using $L^AT_EX$ and following the rules of the forum are very easy but really important, too.Please co-operate.
Using $L^AT_EX$ and following the rules of the forum are very easy but really important, too.Please co-operate.
Re: exercise 1.108 (Greece 2008) [BOMC]
In fact you can use Cauchy or QM-AM inequalities to simplify this problem.
Then solve the last part as you please.
Please read Forum Guide and Rules before you post.
Use $L^AT_EX$, It makes our work a lot easier!
Nur Muhammad Shafiullah | Mahi
Use $L^AT_EX$, It makes our work a lot easier!
Nur Muhammad Shafiullah | Mahi
Re: exercise 1.108 (Greece 2008) [BOMC]
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}$?
\[(\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}$?
A man is not finished when he's defeated, he's finished when he quits.