f ( a , b , c , d ) = a 2 + 1 1 + b 2 + 1 1 + c 2 + 1 1 + d 2 + 1 1
Let a , b , c , d to be non negative real numbers satisfying a b + a c + a d + b c + b d + c d = 6 . Let min f ( a , b , c , d ) = M .
How many ordered quadruples of non-negative real numbers ( a , b , c , d ) satisfy f ( a , b , c , d ) = M ?
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.
Great solution!!
It is a bit lengthy but it reveals that a = b = c = d = 1 is not the only solution.
Had a = b = c = 2 , d = 0 been the only solution then it would have been really difficult for poor users of A . M . ≥ G . M . ≥ H . M . like me.
Keep it up bro!
Log in to reply
Agreed. I've update the question to ask for the number of equality cases, which is the much more interesting problem.
Log in to reply
That's really great, sir. Now it has a bit of combinatorics too. I think it's a Level 5 problem now.
Oh man! It will be difficult for the poor uses to understand but still I love the way you way edit it.
I know a simpler way.....But I dont know latex!!!!!!!!!! i can explain it on slack though
Log in to reply
Can you type up what you can? A moderator can help you make the necessary Latex edits for clarity.
Awesome solution!
Log in to reply
Seriously? BTW How you did this please post it as solution
Yes his work is truly appreciating.
Amazing work Lakshya😉
But i was wondering whether is it really the only way to solve it
Log in to reply
Am GM HM qm as used by my friend @Kaustubh Miglani . @Calvin Lin
Is there any other way
Problem Loading...
Note Loading...
Set Loading...
Let d = min { a , b , c , d } then 0 ≤ d ≤ 1
And p = a b + b c + c a then 3 ≤ p ≤ 6
We have: 6 = a b + b c + c a + d ( a + b + c ) ≥ p + d . 3 p ⇒ d ≤ 3 p 6 − p . So that: d 2 + 1 1 ≥ p 2 − 9 p + 3 6 3 p
Now we define:
x = b c , y = c a , z = a b
So that: x + y + z = p ≥ 3
And we have: a 2 + 1 1 + b 2 + 1 1 + c 2 + 1 1 = x + y z x + y + x z y + z + x y z = A
WLOG we can suppose that : x ≥ y ≥ z
So that: y + x z y ≥ z + x y z and y + x z ≤ z + x y
Use Chebyshev’s Inequality we have: y + x z y . ( y + x z ) + z + x y z ( z + x y ) ≤ 2 1 . ( y + x z y + z + x y z ) . ( y + z + x ( y + z ) ) ⇒ y + x z y + z + x y z ≥ x + 1 2
And x + y z x ≥ x + 4 ( y + z ) 2 x = 4 x + ( p − x ) 2 4 x
So that: A ≥ 4 x + ( p − x ) 2 4 x + x + 1 2
We will prove: 4 x + ( p − x ) 2 4 x + x + 1 2 ≥ p + 3 9 ∀ 0 ≤ x ≤ p , 3 ≤ p ≤ 6
⇔ ( 3 x − p ) 2 ( 2 p − 3 − x ) ≥ 0 (obvious true)
We need to prove: 3 + p 9 + p 2 − 9 p + 3 6 3 p ≥ 2 with 3 ≤ p ≤ 6
⇔ ( 6 − p ) ( p − 3 ) 2 ≥ 0 (obvious true)
Equality holds when x = y = z = p / 3 , p = 3 or p = 6 , that means a = b = c = d = 1 or a = b = c = 2 , d = 0