If N is the largest positive integer that satisfies the inequality
a 2 c + b 2 a + c 2 b ≥ N a b c ,
where a , b , c are positive reals, find the value of N .
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.
Simple use of AM-GM yields
a 2 c + b 2 a + c 2 b ≥ 3 3 a 3 b 3 c 3 Which simply gives N = 3
Same way, trivial !
Level 3??? It doesn't deserve, I suppose. By the way, what the rabbit signifies?
Log in to reply
You're genius-that's why you say so!!
Log in to reply
It is quite simple, don't you think? Well, I think you meant GEN -ius which mean the generation which binds together. Here, bind should mean nuisance. And yes, that's what I am and that's a compliment for me.
Log in to reply
@Kartik Sharma – WOW , Nice, GEN-ius Kartik, lol. But if u are intrested in the bunnies story, then u must see this , a friend of mine, Also, u can locate him on fb, I am just like becoming like sree, LOL
But how can you prove that there can't be a stronger inequality which holds for a larger 'N'.....
General formulatic question, even if you guess with your 6th sense!
Victor, you troller. Rearrange it to get abc+abc + abc = 3abc
Duh.
Problem Loading...
Note Loading...
Set Loading...
Weird solution using rearrangement.
a 2 c + b 2 a + c 2 b ≥ a b c + b c a + c a b = 3 a b c
Which weirdly gives N = 3 .
Equality holds iff a = b = c .