Show that the inequality is true | Geometric Mean

michonamona
Messages
120
Reaction score
0

Homework Statement



Let r_{1}, r_{2}, ... , r_{n} be strictly positive numbers. Show that the inequality

(1+R_{G})^{n} \leq V

is true. Where R_{G} = (r_{1}r_{2}...r_{n})^{1/n} and V= \Pi_{k=1}^{n} (1+r_{k})

Homework Equations





The Attempt at a Solution



I've tried taking the log of both sides, as well as expanding out the term. Any insight?

Thanks,
M
 
Physics news on Phys.org
Use the arithmetic mean-geometric mean inequality... several times.
 
Any other insights?

The prof hinted that we should use log(1+e^x) and associate r with e^x.
 
That's an entirely different way to approach it. The approach I was thinking of uses the fact that the terms of the right side are the elementary symmetric functions of the r_j.
 
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