This is the third proof problem of the series "Olympiad Proof Problems". Try this problem and post your working.
Find the maximum value of the expression , subject to the conditions and .
Details and Assumptions :
Try more proof problems at Olympiad Proof Problems.
EDIT: When dealing with inequalities, find out the condition of equality and check whether the equality condition satisfies the given constraints.
Easy Math Editor
This discussion board is a place to discuss our Daily Challenges and the math and science related to those challenges. Explanations are more than just a solution — they should explain the steps and thinking strategies that you used to obtain the solution. Comments should further the discussion of math and science.
When posting on Brilliant:
*italics*
or_italics_
**bold**
or__bold__
paragraph 1
paragraph 2
[example link](https://brilliant.org)
> This is a quote
\(
...\)
or\[
...\]
to ensure proper formatting.2 \times 3
2^{34}
a_{i-1}
\frac{2}{3}
\sqrt{2}
\sum_{i=1}^3
\sin \theta
\boxed{123}
Comments
I have a fairly long proof for this but hopefully, it is correct. Note that ab+bc+cd+da=(a+c)(b+d).
WLOG, we may assume that ac≥bd. From this, we have a2c2≥abcd=4 and hence ac≥2.
Now, using the AM-GM inequality, we have
10=(a2+c2)+(b2+d2)≥2ac+2bd=2ac+ac8.
Solving the inequality 2ac+ac8≤10, we get 1≥ac≤4. Combining with the result ac≥2 obtained above, we get 2≤ac≤4.
Setting m=a2+c2 and n=ac (m≥2n,2≤n≤4). Under this substitution, we have
(a+c)2=m+2n,(b+d)2=b2+d2+2bd=10−m+n8.
Therefore,
(a+c)2(b+d)2=(m+2n)(10−m+n8)=(n+5+n4)2−(m+n−5−n4)2.
Let's consider two cases:
Case 1: 3n2−5n+4≥0
In this case, we have
m+n−5−n4≥3n−5−n4=n3n2−5n−4≥0.
Therefore,
(a+c)2(b+d)2≤(n+5+n4)2−(3n−5−n4)2=8[n(5−n)+4]≤8{[2n+(5−n)]2+4}=82.
Equality holds when m=2n,n=25,a2+b2+c2+d2=10 and abcd=4. This can be attained for example when a=c=25,b=10205+35,d=10205−35.
Case 2: 3n2−5n+4<0
In this case, we have 2≤n<65+73. Since the function f(n)=n+n4+5 is increasing for n≥2, we get
f(n)<f(65+73)=310+273.
And thus, it follows that
(a+c)2(b+d)2≤(n+5+n4)2<(310+273)2<82.
From this, it follows that the maximum value for (a+c)(b+d)=82.
Proof No.2 (Way shorter)
Once again, ab+bc+cd+da=(a+c)(b+d). We have
(a+c)(b+d)=(a2+c2+2ac)(b2+d2+2bd)
=(a2+c2)(b2+d2)+2ac(b2+d2)+2bd(a2+c2)+4abcd
≤(2a2+b2+c2+d2)2+2(ab+cd)(ad+bc)+16
≤25+2(2ab+bc+cd+da)2+16
=41+21(a+c)2(b+d)2
Solving, we have
(a+c)(b+d)≤41+21(a+c)2(b+d)2
(a+c)2(b+d)2≤41+21(a+c)2(b+d)2
21(a+c)2(b+d)2≤41
(a+c)(b+d)≤82
Log in to reply
@Surya Prakash , the difficulty spiked dramatically here. Perhaps a bit too much. But please, continue posting olympiad questions like this.
You made it too much lengthy.
Log in to reply
I do believe I have another proof which is much shorter. I can't believe I didn't think about this.
Once again, ab+bc+cd+da=(a+c)(b+d). We have
(a+c)(b+d)=(a2+c2+2ac)(b2+d2+2bd)
=(a2+c2)(b2+d2)+2ac(b2+d2)+2bd(a2+c2)+4abcd
≤(2a2+b2+c2+d2)2+2(ab+cd)(ad+bc)+16
≤25+2(2ab+bc+cd+da)2+16
=41+21(a+c)2(b+d)2
Solving, we have
(a+c)(b+d)≤41+21(a+c)2(b+d)2
(a+c)2(b+d)2≤41+21(a+c)2(b+d)2
21(a+c)2(b+d)2≤41
(a+c)(b+d)≤82
Log in to reply
@Surya Prakash , Is this a better proof?
So you have a shorter solution? Can you please share on Slack if you don't want to put it here?
Yes I also got √82 and it's correct.
Using Cauchy Scharw Inequality,
(a2+b2+c2+d2)(b2+c2+d2+a2)≥(ab+bc+cd+da)2
So 10≥(ab+bc+cd+da).
Log in to reply
Using this we get that equality holds when ba=cb=dc=ad. Which gives us thata=b=c=d. So, from the equation a2+b2+c2+d2=10, we get that a=b=c=d=25. This gives us that abcd=425. But abcd=4. So your solution is wrong.
Log in to reply
OH! didnt notice that
You only used the first condition that a^2+b^2+c^2+d^3=10. What about abcd=4?