Titu's upside down

Algebra Level 5

Consider all x , y , z x,y,z positve reals that satisfy,

1 x + 1 y + 1 z = 11 6 . \frac1x + \frac1y+\frac1z=\frac{11}6.

If the minimum value of x + y 4 + z 9 x+ \frac y4 +\frac z9 is in the form of a b \frac ab for coprime positive integers a , b a,b . Find a + b a+b .


The answer is 17.

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.

3 solutions

Thinula De SIlva
Jan 3, 2015

By Cauchy-Schwarz Inequality, ( x + y 4 + z 9 ) ( 1 x + 1 y + 1 z ) ( 1 + 1 2 + 1 3 ) 2 = ( 11 6 ) 2 (x+\frac{y}{4}+\frac{z}{9})(\frac{1}{x}+\frac{1}{y}+\frac{1}{z}) \ge (1+\frac{1}{2}+\frac{1}{3})^2=(\frac{11}{6})^2 Thus, x + y 4 + z 9 ( 11 6 ) 2 1 x + 1 y + 1 z x+\frac{y}{4}+\frac{z}{9} \ge \frac{(\frac{11}{6})^2}{\frac{1}{x}+\frac{1}{y}+\frac{1}{z}} = 11 6 = \frac{11}{6} Therefore, a + b = 6 + 11 = 17 a+b=6+11=\boxed{17}

Note: In order to apply cauchy-schwarz inequality , you needed the terms to be positive. Recall that the expression is of the form ( a i 2 ) ( b I ) 2 ( a i b i ) 2 ( \sum a_i^2 ) ( \sum b_I)^2 \geq ( \sum a_i b_i)^2 .

I've edited this constraint into the problem.

Calvin Lin Staff - 4 years, 7 months ago

Nitpick: are you explicitly showing that the minimum is achieved? (Certainly you did so implicitly.) FWIW, I prefer this solution to my own.

Richard Desper - 4 years, 6 months ago

Log in to reply

Good point! Very often in such extrema problems, showing that equality can be achieved gets forgotten.

Calvin Lin Staff - 4 years, 6 months ago
Jaiveer Shekhawat
Dec 26, 2014

Note: In order to apply titu's lemma , you needed the terms to be positive.

I've edited this constraint into the problem.

Calvin Lin Staff - 4 years, 7 months ago

Very minor point: it's easier to read if you keep the prose outside the LaTeX braces.

Richard Desper - 4 years, 6 months ago
Richard Desper
Nov 30, 2016

Use Lagrange multipliers to find the minimum value of the formula f ( x , y , z ) = x + y 4 + z 9 f(x,y,z) = x + \frac{y}{4}\ + \frac{z}{9} on surface defined by g ( x , y , z ) = 1 x + 1 y + 1 z = 11 6 g(x,y,z) = \frac{1}{x} + \frac{1}{y} + \frac{1}{z} = \frac{11}{6} . Minimum (if it exists) is found when f = λ g \nabla f = \lambda\nabla g for some value of λ \lambda . Now f = ( 1 , 1 4 , 1 9 ) \nabla f = (1,\frac{1}{4},\frac{1}{9}) and g = ( 1 x 2 , 1 y 2 , 1 z 2 ) \nabla g = (\frac{-1}{x^2},\frac{1}{y^2},\frac{1}{z^2}) , so we see equality at the point (1,2,3) with a value of λ = 1 \lambda=-1 . We can search the ray ( t , 2 t , 3 t ) (t,2t,3t) or simply observe that the point (1,2,3) satisfies the constraint. g ( x , y , z ) = 11 6 g(x,y,z) = \frac{11}{6} . Plug in the point (1,2,3) to observe minimum f ( 1 , 2 , 3 ) = 1 + 2 4 + 3 9 = 11 6 f(1,2,3) = 1 + \frac{2}{4} + \frac{3}{9} = \frac{11}{6} in reduced form a b \frac{a}{b} with a = 11 a=11 and b = 6 b=6 . Thus a + b = 17 a+b=17 .

0 pending reports

×

Problem Loading...

Note Loading...

Set Loading...