Is It Really Balancing The Coefficients?

Algebra Level 5

Let a a , b b and c c be positive real numbers satisfying ( a + b + c ) ( 1 a + 1 b + 1 c ) = 16 (a+b+c)\left(\frac {1}{a} + \frac {1}{b} +\frac {1}{c}\right) =16 If the smallest and largest possible values of a b + b c + c a \frac {a}{b} + \frac {b}{c} +\frac {c}{a} are m m and M M respectively, then find the value of 100 ( m + 2 M ) \lfloor 100 (m+2M )\rfloor .


The answer is 2061.

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.

1 solution

Mark Hennings
Apr 26, 2016

Relevant wiki: Classical Inequalities - Problem Solving - Advanced

Since the target function a b + b c + c a \tfrac{a}{b}+\tfrac{b}{c} + \tfrac{c}{a} and the constraint equation are both homogeneous, we can apply the additional constraint a + b + c = 4 a+b+c=4 without loss of generality. Thus we must have a b + a c + b c a b c = a 1 + b 1 + c 1 = 4 \frac{ab + ac + bc}{abc} \; = \; a^{-1} + b^{-1} + c^{-1} \; = \; 4 and hence a , b , c a,b,c are the roots of a cubic polynomial f γ ( X ) = X 3 4 X 2 + 4 γ X γ = 0 f_\gamma(X) \; =\; X^3 - 4X^2 + 4\gamma X - \gamma \; = \; 0 for some γ > 0 \gamma > 0 ; of course, γ = a b c \gamma = abc . If we define U = a b + b c + c a V = a c + c b + b a U \; = \; \frac{a}{b} + \frac{b}{c} + \frac{c}{a} \qquad \qquad V \; = \; \frac{a}{c} + \frac{c}{b} + \frac{b}{a} then some elementary calculations with Vieta's and Newton's formulae tell us that U + V = 13 U V = 64 γ 87 + 64 γ 1 U + V \; = \; 13 \qquad \qquad UV \; = \; 64\gamma - 87 + 64\gamma^{-1} and hence U , V U,V are the roots of the quadratic equation X 2 13 X + U V = 0 , X^2 - 13X + UV \; = \; 0 \;, so that U , V = 1 2 [ 13 ± 169 4 U V ] . U,V \; = \; \tfrac12\big[13 \pm \sqrt{169 - 4UV}\big] \;. Thus the maximum and minimum possible values of U U and V V are both achieved when U V UV is minimized.

Over all values of γ > 0 \gamma > 0 , U V UV is minimized when γ = 1 \gamma=1 , and the corresponding minimum value is 41 41 . We just need to check that f 1 ( X ) f_1(X) is a polynomial with positive roots. But f 1 ( X ) = X 3 4 X 2 + 4 X 1 = ( X 1 ) ( X 2 3 X + 1 ) , f_1(X) \; = \; X^3 - 4X^2 + 4X - 1 \; = \; (X - 1)(X^2 - 3X + 1)\;, which does indeed have three positive roots. Thus we deduce that the maximum and minimum possible values of U U are the two roots of X 2 13 X + 41 = 0 X^2 - 13X + 41 \,=\, 0 , and hence m = 1 2 [ 13 5 ] M = 1 2 [ 13 + 5 ] . m \; = \; \tfrac12\big[13 - \sqrt{5}\big] \qquad \qquad M \; = \; \tfrac12\big[13 + \sqrt{5}\big] \;. Note that the difference between U U and V V is just a matter of the labelling of a , b , c a,b,c ; if U = m U = m for ( a , b , c ) = ( u , v , w ) (a,b,c) = (u,v,w) , then V = M V=M for ( a , b , c ) = ( u , v , w ) (a,b,c) = (u,v,w) , and so U = M U = M for ( a , b , c ) = ( u , w , v ) (a,b,c) = (u,w,v) , after making a noncyclic permutation of the values of a , b , c a,b,c .

Thus the answer is 100 × 1 2 ( 39 + 5 ) = 2061 \left\lfloor 100 \times \tfrac12(39 + \sqrt{5})\right\rfloor \,=\, \boxed{2061} .

@Mark Hennings Can you explain how you have found the constraint a + b + c = 4 a+b+c=4 .

Filippo Olivetti - 3 years, 11 months ago

Log in to reply

The choice of 4 4 was arbitrary, but it did make some of the later equations a bit simpler to write down - it meant that all the polynomials had integer coefficients.

Mark Hennings - 3 years, 11 months ago

Log in to reply

So, is this a consequence of the homogeneous equation?

Filippo Olivetti - 3 years, 11 months ago

Log in to reply

@Filippo Olivetti Yes. Since both the constraint equation and the target function are homogeneous of degree 0 0 , the problem is scaling-invariant, and so we can elect to pick a specific value of a + b + c a+b+c as an additional constraint.

Mark Hennings - 3 years, 11 months ago

0 pending reports

×

Problem Loading...

Note Loading...

Set Loading...