Thread: Problem 21
View Single Post
  #16  
Old April 22nd, 2007, 06:57 PM
slobone's Avatar
slobone slobone is offline
Newbie
 
Join Date: Mar 2007
Posts: 9
Country:
Thanks: 0
Thanked 0 Times in 0 Posts
slobone is on a distinguished road
Default

Quote:
Originally Posted by CaptainBlack View Post
As f(x)>0 for all x>=0 all roots are negative. Let these be -b1, -b2, .. -bn,
with all the b's >0.

Then:

f(x) =(x+b1)(x+b2) ..(x+bn)

Also as the constant term is 1 we know that b1.b2. .. bn = 1.

Now 2 + bk = 1 + 1 + bk >= 3 cuberoot(1.1.bk), by the Arithmetic-Geometric
mean inequality.
So (2+bk) >= 3cuberoot(bk)

So for x=2:

f(2) = (2+b1)(2+b2) ...(2+bn) >= 3^n cuberoot(b1.b2. .. bn) = 3^n

RonL
That was the thing I needed. I suspected it was true, but I didn't know it was a theorem. Good problem.