c 2 + b c 9 a 2 + 9 a b + a 2 + a c 1 2 b 2 + 1 2 b c + b 2 + a b 1 6 c 2 + 1 6 a c
Let a , b , c be positive real numbers. The ratio of c : a such that the above expression is minimized can be expressed as a fraction in the form
p m + n
where m , n , p are integers and n is not divisible by the square of any prime.
Find m + n + p .
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.
nice lapang
Damn. Guess what i did ??????? -1+7+2=10
Highly overrated problem.
Problem Loading...
Note Loading...
Set Loading...
Let our expression equal k
Since a , b , c are positive real numbers, any combinations of sums, products, and quotients of a , b , c will be a positive real number.
This means we can use the AM-GM Inequality on our expression.
First let's factor it as:
c ( b + c ) 9 a ( a + b ) + a ( a + c ) 1 2 b ( b + c ) + b ( a + b ) 1 6 c ( a + c ) = k
AM-GM gives us:
3 k ≥ 3 ( c ) ( b + c ) ( a ) ( a + c ) ( b ) ( a + b ) ( 9 ) ( a ) ( a + b ) ( 1 2 ) ( b ) ( b + c ) ( 1 6 ) ( c ) ( a + c )
Everything under the radical cancels except for the 9 × 1 2 × 1 6 , so we are left with
3 k ≥ 3 9 × 1 2 × 1 6 k ≥ 3 6
We know by the AM-GM Inequality for positive real numbers x , y , z that 3 x + y + z ≥ 3 x y z , and that equality is achieved if and only if x = y = z .
So we now know that:
c ( b + c ) 9 a ( a + b ) = 1 2 , a ( a + c ) 1 2 b ( b + c ) = 1 2 , b ( a + b ) 1 6 c ( a + c ) = 1 2
Let's start with the middle equation, so we have:
a ( a + c ) 1 2 b ( b + c ) = 1 2 b 2 + b c = a 2 + a c
We can see by inspection that if a = b , this equation holds true. Algebraically, we can simplify further:
b 2 − a 2 = ( a − b ) c − ( b + a ) = c
We know that this case can't happen, since unless a = b = c = 0 , either b + a or c is negative. a , b , c > 0 , so none of these cases are within our constraints. This means equality will occur only when a = b .
Looking back, we also know that:
c ( b + c ) 9 a ( a + b ) = 1 2 , b ( a + b ) 1 6 c ( a + c ) = 1 2
Let's let a = 1 , since we can later scale our answer without changing the ratio. This means that b = 1 as well. In the first equation, we end up with:
c ( 1 + c ) 1 8 = 1 2
c 2 + c − 2 3 = 0
Using Quadratic Formula , we get:
c = 2 − 1 ± 1 − ( 4 ) ( 1 ) ( 2 − 3 )
c > 0 , so we know that the minus solution doesn't exist within our constraints.
c = 2 − 1 + 7
To make sure this minimum is actually attained, we need to check the other equation as well:
b ( a + b ) 1 6 c ( a + c ) = 1 2
a = b = 1 , so we have:
2 1 6 c ( 1 + c ) = 1 2
c 2 + c − 2 3 = 0
We could do quadratic formula again, but we can see that this is indeed the exact same quadratic as before.
Since we found positive real values of a , b , c such that all of our previous conditions are satisfied, we can conclude that:
a = 1 , b = 1 , c = 2 − 1 + 7
is a combination of a , b , c that will give us our minimum. Thus, the ratio of c : a is:
2 − 1 + 7 : 1
Expressed as a fraction is:
2 − 1 + 7
− 1 , 2 , 7 are all integers and 7 is not divisible by the square of any prime. Thus, our answer is:
− 1 + 2 + 7 = 8