Cauchy-Schwarz -> AM-HM inequality

  • Thread starter Thread starter EighthGrader
  • Start date Start date
  • Tags Tags
    Inequality
EighthGrader
Messages
11
Reaction score
0

Homework Statement



Prove the AM-HM inequality using the Cauchy-Schwarz Inequality.

Homework Equations



Cauchy Schwarz Inequality:

<br /> \[ \biggl(\sum_{i=1}^{n}a_{i}b_{i}\biggr)^{2}\le\biggl(\sum_{i=1}^{n}a_{i}^{2}\biggr)\biggl(\sum_{i=1}^{n}b_{i}^{2}\biggr)\<br />

AM-HM inequality:

A(n,a_i) = \frac{a_1 + a_2+\cdots+a_n}{n}\


H(n,a_i) = \frac{n}{\frac{1}{a_1}+\frac{1}{a_2}+ \cdots+\frac{1}{a_n}}\


A(k,x_i) \geq H(k,x_i)\

The Attempt at a Solution



I just need some tips on how to approach this problem. How do I introduce the term n on both sides?
 
Physics news on Phys.org
\left(\sum _{i=1}^n \frac{1}{a_i}\right)\left(\sum _{i=1}^n a_i\right)\geq \left(\sum _{i=1}^n \frac{\sqrt{a_i}}{\sqrt{a_i}}\right){}^2
 
There are two things I don't understand about this problem. First, when finding the nth root of a number, there should in theory be n solutions. However, the formula produces n+1 roots. Here is how. The first root is simply ##\left(r\right)^{\left(\frac{1}{n}\right)}##. Then you multiply this first root by n additional expressions given by the formula, as you go through k=0,1,...n-1. So you end up with n+1 roots, which cannot be correct. Let me illustrate what I mean. For this...
Back
Top