If a , b , c > 0 , a 2 = b c and a + b + c = a b c , then find the least value of a 4 + a 2 − 7 .
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.
Well written , upvoted sir.
By AM-GM, we have
a + b + c ≥ 3 3 a b c .
Squaring and cancellation alongwith the fact a + b + c = a b c , gives
( a b c ) 2 ≥ 2 7 .
Putting a 2 = b c gives
b c ≥ 3 or a 2 ≥ 3 .
So, a 4 + a 2 − 7 ≥ ( 3 ) 2 + ( 3 ) 1 − 7 = 5 .
Nicely done. Are you appearing for GMO?
Log in to reply
No, i have given KVS JUNIOR MATHEMATICAL OLYMPIAD. If i get selected , then i can directly give INMO 2017.
Log in to reply
Can you post the paper?
Log in to reply
@Kushagra Sahni – Yes. Within half an hour.
We have b , c must be the roots of the quadratic X 2 − ( a 3 − a ) X + a 2 = 0 For this quadratic to have two (possibly repeated) positive roots we need a 3 − a > 0 and also ( a 3 − a ) 2 − 4 a 2 ≥ 0 , so that we must have a > 1 and 0 ≤ a 6 − 2 a 4 − 3 a 2 = a 2 ( a 2 + 1 ) ( a 2 − 3 ) and hence we must have a 2 ≥ 3 . This makes the answer 9 + 3 − 7 = 5 .
Given that a 2 = b c , a + b + c = a b c Second equation implies, b + c = a ( b c − 1 ) Applying AM-GM and substituting value of b c from first equation at the top,we have, 2 a ( a 2 − 1 ) > = a ⇒ a 2 > = 3 Putting the minimum value we got of a 2 we get answer as 5 .
Since we have a 2 = b c , we can write b and c parametrically as b = k a and c = k a for some variable real positive constant k (as a , b , c > 0 . Substituting this into a + b + c = a b c , we get a + k a + k a = a ( k a ) ( k a ) = a 3 . Since a > 0 , we must have 1 + k + k 1 = a 2 . Therefore for any k , we can generate a value for a and thus values for b and c .
To minimise a 4 + a 2 − 7 , this is a strictly increasing function in a for a > 0 so to find the minimum of this, we need the minimum value for a (or more over, a 2 ). Since we can make a 2 as small as possible by making 1 + k + k 1 as small possible too, using the AM-GM inequality, we have 1 + k + k 1 ≥ 3 1 × k × k 1 = 3 where equality holds when k = 1 . This means the least value of a 2 is 3 and futher a 4 is 3 2 = 9 . Therefore the smallest value of a 4 + a 2 − 7 is 9 + 3 − 7 = 5 .
Problem Loading...
Note Loading...
Set Loading...
Since a 2 = b c ⟹ a + b + c = a b c = a ⋅ a 2 = a 3 . Then a b + b c + c a = a b + a a + c a = a ( b + a + c ) = a ⋅ a 3 = a 4 . Therefore, a 4 + a 2 = a b + b c + c a + b c . Since a , b , c > 0 , we can use AM-GM inequality as follows:
a b + b c + c a + b c a 4 + a 2 ⟹ a 4 a 2 a 4 ≥ 4 4 a 2 b 3 c 3 ≥ 4 4 a 8 = 4 a 2 ≥ 3 a 2 ≥ 3 ≥ 9
⟹ a 4 + a 2 − 7 ≥ 9 + 3 − 7 = 5