Given that a , b , c are positive reals such that the maximum value of N which satisfies the inequality
b + c a + a + c b + a + b c ≥ N
can be expressed in the form n m , where m and n are coprime, positive integers, find the value of m + n .
Details and Assumptions
For those who know a certain inequality, this problem is going to be a no-brainer. :D
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.
Alternate solution:
Let S = b + c a + a + c b + a + b c M = b + c b + a + c c + a + b a N = b + c c + a + c a + a + b b
By AM-GM, S + M ≥ 3 S + N ≥ 3
So 2 S + M + N ≥ 6
S ≥ 2 3
And 3 + 2 = 5
:D
Log in to reply
how did u come to know that inequality must b greater than equal to 3?
Log in to reply
S + M = b + c a + b + a + c b + c + a + b a + c
Applying AM-GM, S + M ≥ 3
Same goes for S + N :D
simple and elegant!!
The problem is simply Nesbitt's Inequality. :D
add 3 to both sides. (a+b+c) (1/(a+b) + 1/(b+c) + 1/(c+a)) multiply both sides by 2 and write 2a+2b+2c = (a+b) + (b+c) + (c+a) now apply am-hm inequality. nesbitt's :)
This solution works even if a , b , c are negative reals. But, I don't think this in-equality holds for negative reals.
By A.M.-G.M. inequality
2 a + b ≥ a b ⇒ a+b ≥ 2 a b ----->(1)
2 b + c ≥ b c ⇒ b+c ≥ 2 b c ----->(2)
2 c + a ≥ c a ⇒ c+a ≥ 2 c a ----->(3)
b + c a + c + a b + a + b c ≥ N
⇒ 2 b c a + 2 c a b + 2 a b c ≥ N
⇒ 8 a b c 2 a 2 b c + 2 b 2 c a + 2 c 2 a b ≥ N
⇒ 8 a b c 2 a b c ( b c a + c a b + a b c ) ≥ N
Now
b c a + c a b + a b c ≥ N ⇒ b c a + c a b + a b c ≥ 4
⇒ N=4
We can express 4 in the form of n m as 1 4 ⇒ m+n=4+1= 5
The answer is not
4
. It is
2
3
.
See
@Victor Loh
's solution. The equality holds at the minimum. (I.e.
a
=
b
=
c
)
Problem Loading...
Note Loading...
Set Loading...
By Cauchy-Schwarz, we have
[ ( b + c ) + ( a + c ) + ( a + b ) ] ( b + c 1 + a + c 1 + a + b 1 ) ≥ 9 ,
or
2 ( b + c a + b + c + c + a a + b + c + a + b a + b + c ) ≥ 9 ,
which yields the desired result
b + c a + a + c b + a + b c ≥ 2 3
so m + n = 5 and we are done.