{ a + b + c = 1 0 a b + b c + c a = 2 5
Let a , b and c be real numbers such that the system of equations above is true. If the sum of the minimum and maximum values of c can be written in the form y x , where x and y are coprime positive integers, find x + y .
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.
You have shown that 0 ≤ c ≤ 3 2 0 . You should also note that it is possible ( a = b = 5 , c = 0 ) to have c = 0 and also ( a = b = 3 5 , c = 3 2 0 ) to have c = 3 2 0 .
Log in to reply
Ah, yes. Should have written that as well. Thanks for reminding me.
Dude why is 20+3? Answer should be 3 2 0
Log in to reply
Ok, so this is a prominent bug that has been hunting a lot of my problems that I make. What happens is that whenever I press Preview, then go back to edit the problem, then press Preview and Post the problem, the question reverts back to the previous un-edited version, causing these errors in my problems. I have told staff about this before, but no changes have occurred since. Sorry for the inconvenience.
Thanks for the inspiration!
Log in to reply
Needs hell lot of calculations.
Log in to reply
Why so? You need not.
I think someone who have solved many lvl 5 problems should know that a 4 + b 4 + c 4 − 2 ( a 2 b 2 + b 2 c 2 + c 2 a 2 ) = ( a + b + c ) ( a + b − c ) ( a − b + c ) ( a − b − c ) .
So why calculation? Did you directly solve the problem?
Log in to reply
@Steven Jim – That comment wasn't made to offend you... Just said that because calculations might have been made easier :-)
Log in to reply
@Rishabh Jain – Woah woah... I haven't had any thoughts that you offend me XD
@Rishabh Jain – By the way, what do you think about my solution? And again, how did you solve the problem (what method)?
Log in to reply
@Steven Jim – Same.. by Sharkey's method.
@Steven Jim – Nice method though. +1
So here's the proof that you need not use much (almost none) calculation to solve the problem. The hint is actually the generalization.
https://brilliant.org/problems/inspired-by-sharky-kesa-9/?ref_id=1370530
From the identity ( a + b + c ) 2 = a 2 + b 2 + c 2 + 2 ( a b + b c + c a ) , and substituting the values given , we get a 2 + b 2 + c 2 = 5 0 ⟹ a 2 + b 2 = 5 0 − c 2 A l s o , a + b = 1 0 − c From Cauchy-Schwarz Inequality , a 2 + b 2 ≥ 2 1 ( a + b ) 2 Putting the values of a 2 + b 2 and a + b , we get: 5 0 − c 2 ≥ 2 1 ( 1 0 − c ) 2 On simplifying we are left with 0 ≤ 3 c 2 − 2 0 c which gives 0 ≤ c ≤ 3 2 0 yeilding maximum value as 3 2 0
if you take the derivative of x 3 − 1 0 x 2 + 2 5 x you get 3 x 2 − 2 0 x + 2 5 and the sum of the zeros is 3 2 0 when added together gives you 2 3
Problem Loading...
Note Loading...
Set Loading...
Firstly, note that a + b = 1 0 − c and a b = 2 5 − c ( a + b ) = 2 5 − c ( 1 0 − c ) . Thus, we have
0 ≤ ( a − b ) 2 = ( a + b ) 2 − 4 a b = ( 1 0 − c ) 2 − 4 ( 2 5 − c ( 1 0 − c ) ) = c 2 − 2 0 c + 1 0 0 − 1 0 0 + 4 0 c − 4 c 2 = 2 0 c − 3 c 2 = c ( 2 0 − 3 c )
Thus, 0 ≤ c ≤ 3 2 0 , so the sum of the minimum and maximum values of c is 3 2 0 . These values in ( a , b , c ) occur at ( 5 , 5 , 0 ) and ( 3 5 , 3 5 , 3 2 0 ) . Therefore, the answer is 2 0 + 3 = 2 3 .