Real numbers a , b , c , d satisfy
a 2 + b 2 = c 2 + d 2 .
If the maximum of the expression
a 2 + b 2 + c 2 + d 2 2 0 b c + 1 4 b d + 2 0 a d − 1 4 a c
can be expressed as n for some positive integer n , what is 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.
@Daniel Liu @Finn Hulse Like this :) ?
You would notice a lot of similarities, especially if you are familiar with the trigonometric proof of Cauchy Schwarz.
Log in to reply
Darn, I don't have the expertise in Ineqs to make this type of solution. Thanks for sharing though :)
Where can I found the trigonometric proof of Cauchy Schwarz? I searched but not success
Hello @Calvin Lin , how could you know that * A=0, B= 5 9 6 , C=20 and D=14 *
Log in to reply
Review applying the cauchy schwarz inequality . What are the conditions for equality to occur?
Note further that we also have a 2 + b 2 = c 2 + d 2 as given in the problem.
Hint: There are many equality cases, and we just want to find (at least) one. Setting a variable to be a specific value can simplify the work (and hopefully still allow for a solution). In this case, I set a = 0 .
Yes , you are right here.They are almost pretty same.
Calvin, of course it's awesome, you rock. But I've been trying to boost my Algebra rating, and almost all Level 4 and Level 5 problems involve minimizing and maximizing weird expressions. I am TERRIBLE with inequalities and optimization, so any tips would be amazing. Also, how was IMO? How did you do?
I also solved it with Cauchy-Schwarz and Fermat's Two Square Identity. I like this problem and the solution.
Exactly the same way.
I had a slightly different approach. I considered the sequences {a, b, c, d} and {-14c, 14d, 20b, 20a} and tried to use the cauchy shwarz inequality. I got:
(a² + b² + c² + d²)(196c² + 196d² + 400b² + 400a²) ≥ (-14ac + 14bd + 20bc + 20ad)²
=> (a² + b² + c² + d²)(196(c² + d²) + 400(b² + a²)) ≥ (-14ac + 14bd + 20bc + 20ad)²
or, (a² + b² + c² + d²)(596(a²+b²))≥(-14ac + 14bd + 20bc + 20ad)²
Which is, 298(a² + b² + c² + d²)² ≥(-14ac + 14bd + 20bc + 20ad)² Hence,
√298 ≥(-14ac + 14bd + 20bc + 20ad)/(a² + b² + c² + d²)
I am not sure why. Any help would be appreciated.
Log in to reply
Remember that to show something is a maximum, we have to show that
1. It is an upper bound.
2. It is the least upper bound (IE that it can be achieved).
You have done 1, but not 2 as yet. Saying that 2 9 8 is an upper bound does not contradict the claim that 1 4 9 is the least upper bound.
Did you check the equality condition for your Cauchy Schwarz? When does equality hold?
Log in to reply
I tried to check for an equality condition but I don't think it exists. I am beginning to see why my approach was not working.
So does this mean if I take any two sets of terms and apply the Cauchy Shwarz inequality, the equality condition is not guaranteed to exist?
Also, are there any further implications of such a case, where the equality condition does not exist in the Cauchy-Shwarz inequality?
Log in to reply
@Rishabh Garg – Right, your approach produced an upper bound but doesn't yet show that it is the least upper bound (and you can't because it is not the least upper bound).
Yes, and this is true more generally. As a simpler example to consider, suppose you wanted to minimize
f
(
x
)
=
g
(
x
)
+
h
(
x
)
, where
g
(
x
)
=
x
2
and
h
(
x
)
=
(
x
2
+
4
x
+
4
)
. We know that 0 is the minimum of
g
(
x
)
and 0 is the minimum of
h
(
x
)
.
1. Is it true that 0 is a lower bound of
f
(
x
)
?
2. is it true that 0 is the minimum of
f
(
x
)
?
3. What is the minimum of
f
(
x
)
?
You raised a good question. If the equality condition of
g
(
x
)
and
h
(
x
)
have a non-empty intersection, what can we say about the min/max of
g
(
x
)
+
h
(
x
)
?
E.g. We can say that
m
a
x
(
g
(
x
)
+
h
(
x
)
)
≤
m
a
x
g
(
x
)
+
m
a
x
h
(
x
)
.
Off the bat, seeing a 2 + b 2 = c 2 + d 2 makes us think of the identity sin 2 θ + cos 2 θ = 1 . But will substituting simple variables as complicated trigonometric functions help? Let's find out.
First, to make the substitution, let's define a variable x such that a 2 + b 2 = c 2 + d 2 = x 2 . Thus, we can substitute a = x sin α , b = x cos α , c = x sin β , and d = x cos β . Cool, we reduced it to only three variables to juggle around!
Substituting these values in the expression we want to maximize, along with substituting a 2 + b 2 = x 2 and c 2 + d 2 = x 2 , we obtain that the expression is equivalent to
2 x 2 2 0 x 2 cos α sin β + 1 4 x 2 cos α cos β + 2 0 x 2 sin α cos β − 1 4 x 2 sin α sin β
Hey look, the 2 x 2 cancel out! We know know that we are definitely heading the right direction, with only two variables to handle now. We are left with the expression
1 0 cos α sin β + 7 cos α cos β + 1 0 sin α cos β − 7 sin α sin β
Seeing the coefficients, we should group the pairs together. Grouping gives
1 0 ( sin α cos β + sin β cos α ) + 7 ( cos α cos β − sin α sin β )
Incredible! We recognize the expressions inside the parentheses as two of the four angle sum/difference identities! Applying the two applicable identities in reverse, we obtain
1 0 sin ( α + β ) + 7 cos ( α + β )
We can now substitute even further by letting θ = α + β , leaving us with a one-variable expression to maximize. We want to maximize
1 0 sin θ + 7 cos θ
However, it isn't immediate how to maximize this. We can't use sin 2 θ + cos 2 θ = 1 because the coefficients are different (even if they are the same, we actually still cannot obtain the maximum anyways), nor can we use sin θ = cos ( 9 0 − θ ) because that would make the angle value of the two expression be different...
Well, what if 1 0 = cos φ and 7 = sin φ for some variable φ ? We could use the sine angle sum identity one more time to reduce it to one trig function! However, it's clear that there isn't any real φ that satisfies either equation.
However, if we scale the entire expression down, maybe there will exist a φ ! So let's scale the expression down by a factor of S to obtain
S ( S 1 ⋅ 1 0 sin θ + S 1 ⋅ 7 cos θ )
Now, let' set cos φ = S 1 ⋅ 1 0 and sin φ = S 1 ⋅ 7 .
Now we can use sin 2 φ + cos 2 φ = 1 to find the value of S : ( S 1 ⋅ 1 0 ) 2 + ( S 1 ⋅ 7 ) 2 S 2 1 0 0 + S 2 4 9 1 4 9 S = 1 = 1 = S 2 = 1 4 9
Thus, our expression turns into 1 4 9 ( sin θ cos φ + sin φ cos θ ) which is simply 1 4 9 sin ( θ + φ )
The maximum value of this expression is clearly 1 4 9 , as sin ( θ + φ ) ≤ 1 . Thus, the maximum of our original expression is also 1 4 9 and our final answer is 1 4 9 . □
Problem Maker's Note: Using this method, we can also very easily find the minimum value of our expression. Because sin ( θ + φ ) ≥ − 1 , the minimum value is simply − 1 4 9 !
Well I used complex numbers approach to yield a somewhat similar answer. Nevertheless, good solution Daniel. +1 for it.
Well, I just immediately thought of Cauchy-Schwarz. This is really a great and different solution! One more thing to say is, the maximum value of 1 0 sin θ + 7 cos θ can also be easily get by the R-Method , it will be 1 0 2 + 7 2 = 1 4 9
Exactly what I did!! I dnt think it was reqd to write anything after 1 0 s i n θ + 7 c o s θ Anyways, awesome!
In a same way I solved the problem as you did for getting answer very quickly
Hmm... I wonder if there's a pattern. Seeing as the answer was 1 0 2 + 7 2 and those were both two very critical parts of the expression...
Log in to reply
Hint: Cauchy Schwarz.
This is also the right place to reiterate one of my favorite algebraic identities, namely Fermat's Two square identity.
Yep, there indeed is a pattern.
Let's try to maximize the expression a sin θ + b cos θ We first multiply by the scale factor, like in the solution. We obtain the expression S ( S a sin θ + S b cos θ )
Now we let cos φ = S a and sin φ = S b . We use sin 2 φ + cos 2 φ = 1 to get S 2 a 2 + b 2 = 1 or S = a 2 + b 2 . Thus, we have proved that the maximum of a sin θ + b cos θ or any real numbers a , b is a 2 + b 2 .
EDIT: sniped by Calvin. However, my solution is different than both of his hints.
Log in to reply
My comment yields a 3 line solution to your problem. You are nearly there, you just got sidetracked by doing trignometric substitutions.
Have fun figuring out the solution. If you don't get it by Sunday, give me a shout and I'd post mine.
Log in to reply
@Calvin Lin – Darn, I was hoping there wouldn't be any easier solutions, because my solution was the one I intended. I'm pretty shaky at C-S, so I don't see the solution right now... I'll see what I can think up.
This is also the maximum for a sin k θ + b cos k θ .
i've used a=b=c=d=x, but it gave me wrong answer........why so?
Log in to reply
The equality case for optimization problems does not have to be where the variables are all equal! There are many inequalities where the inequality case is not where all the variables are the same. Quoting from @Calvin Lin :
This is done by setting a = 0 , b = 5 9 6 , c = 2 0 , d = 1 4 . Hence, the maximum is 1 4 9 .
As you can see, the equality case is rather wonky and unforeseeable.
I used complex numbers and trigonometry to get here
Problem Loading...
Note Loading...
Set Loading...
What does ( b c + a d ) and ( b d − a c ) remind you of? It has to be Fermat's Two Square Identity, which states that
( a 2 + b 2 ) ( c 2 + d 2 ) = ( b c + a d ) 2 + ( b d − a c ) 2 !
For the solution, applying Cauchy Schwarz, we have
[ 2 0 ( b c + a d ) + 1 4 ( b d − a c ) ] 2 ≤ [ ( b c + a d ) 2 + ( b d − a c ) 2 ] [ 2 0 2 + 1 4 2 ] = ( a 2 + b 2 ) 2 × 5 9 6
This thus gives us
∣ ∣ ∣ ∣ a 2 + b 2 + c 2 + d 2 2 0 ( b c + a d ) + 1 4 ( b d − a c ) ∣ ∣ ∣ ∣ ≤ 1 4 9 .
It remains to verify that equality in Cauchy Schwarz can exist. This is done by setting a = 0 , b = 5 9 6 , c = 2 0 , d = 1 4 . Hence, the maximum is 1 4 9 .