If a , b and c are constants satisfying the inequality a x 2 + x b ≥ c , where x > 0 , find the minimum vlaue of c 3 a b 2 .
If the minimum value can be expressed as q p , where p and q are coprime positive integers, submit your answer as p + q .
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.
If we set 3 ( 4 a b 2 ) 3 1 ≥ c . Than our original equation will always remain true.
More accurately, it should be phrased as "Thus, the original equation is true if and only if 3 ( 4 a b 2 ) 3 1 ≥ c ".
Otherwise, as written, you have found a sufficient condition but haven't explained that it is necessary. Thus, the minimum bound that you have applies to this restricted set (with a sufficient condition), and need not apply to the possibly larger set of solutions.
As an explicit example, "If we set ( 4 a b 2 ) 3 1 ≥ c . Than our original equation will always remain true." This would then give us c 3 a b 2 ≥ 4 which clearly isn't the minimium of all possible values.
Did the same. the same kind of question was there in JEE 2016
Problem Loading...
Note Loading...
Set Loading...
First notice that
a x 2 + x b = a x 2 + 2 x b + 2 x b
Now apply AM-GM 3 a x 2 + 2 x b + 2 x b ≥ ( 4 a b 2 ) 3 1 If we set 3 ( 4 a b 2 ) 3 1 ≥ c Than our original equation will always remain true. Hence 2 7 ( 4 a b 2 ) ≥ c 3 or c 3 a b 2 ≥ 2 7 4 Hence our answer is 4+27= 31
There is also a calculus approach.