Cubic conundrum 2

Algebra Level pending

Let f ( x ) f(x) be a monic cubic polynomial with f ( 0 ) = 64 f(0)=-64 , and all roots of f ( x ) f(x) are non-negative real numbers. What is the largest possible value of f ( 1 ) f(-1) ? (A polynomial is monic if its leading coefficient is 1)


The answer is -125.

This section requires Javascript.
You are seeing this because something didn't load right. We suggest you, (a) try refreshing the page, (b) enabling javascript if it is disabled on your browser and, finally, (c) loading the non-javascript version of this page . We're sorry about the hassle.

2 solutions

Let the three positive real roots be a a , b b , and c c . By Vieta's formula the monic cubic polynomial is

f ( x ) = x 3 ( a + b + c ) x 2 + ( a b + b c + c a ) x 64 where a b c = 64 f ( 1 ) = 1 ( a + b + c ) ( a b + b c + c a ) 64 By AM-GM inequality, a + b + c 3 a b c = 3 4 1 12 48 64 and a b + b c + c a 3 ( a b c ) 2 = 3 4 2 = 125 Equality occurs when a = b = c = 4. \begin{aligned} f(x) & = x^3 -(a+b+c)x^2 + (ab+bc+ca)x - \blue{64} & \small \blue{\text{where } abc = 64} \\ \implies f(-1) & = -1 - \blue{(a+b+c)} - \red{(ab+bc+ca)} - 64 & \small \blue{\text{By AM-GM inequality, }a+b+c \ge 3\sqrt{abc} = 3\cdot 4} \\ & \le -1 - \blue{12} - \red{48} - 64 & \small \red{\text{and }ab+bc+ca \ge 3\sqrt{(abc)^2} = 3\cdot 4^2} \\ & = \boxed{-125} & \small \blue{\text{Equality occurs when }a=b=c=4.} \end{aligned}

Reference: AM-GM inequality

Chris Lewis
Dec 1, 2020

Let the polynomial be f ( x ) = ( x u ) ( x v ) ( x w ) f(x)=(x-u)(x-v)(x-w) where u , v , w u,v,w are non-negative real numbers.

Then f ( 0 ) = u v w f(0)=-uvw so that u v w = 64 uvw=64 and f ( 1 ) = ( 1 + u ) ( 1 + v ) ( 1 + w ) f(-1)=-(1+u)(1+v)(1+w) .

By symmetry, we want u = v = w = 4 u=v=w=4 , giving f ( 1 ) = 125 f(-1)=\boxed{-125} .


To check, though, we can maximise this with a Lagrangian multiplier. Define F ( u , v , w , L ) = ( 1 + u ) ( 1 + v ) ( 1 + w ) + L ( u v w 64 ) F(u,v,w,L)=-(1+u)(1+v)(1+w)+L(uvw-64)

Setting the partial derivatives to zero, this gives L v w = ( 1 + v ) ( 1 + w ) L w u = ( 1 + w ) ( 1 + u ) L u v = ( 1 + u ) ( 1 + v ) u v w = 64 \begin{aligned} Lvw &=(1+v)(1+w) \\ Lwu&=(1+w)(1+u) \\ Luv &=(1+u)(1+v) \\ uvw&=64 \end{aligned}

We can solve these by multiplying the first three equations together and substituting in for u v w uvw ; the algebra gets a little messy but in the end we find u = v = w = 1 L 1 u=v=w=\frac{1}{\sqrt{L}-1}

so that, again, u = v = w = 4 u=v=w=4 .

Is there a way of using AM-GM or another inequality to find the maximum here?

Chris Lewis - 6 months, 1 week ago

Log in to reply

Hölder's Inequality can help

Danish Ahmed - 6 months, 1 week ago

0 pending reports

×

Problem Loading...

Note Loading...

Set Loading...