Let S be the maximum possible value of b 3 + 4 a + c 3 + 4 b + d 3 + 4 c + a 3 + 4 d given that a , b , c , d are nonnegative real numbers such that a + b + c + d = 4 . Given that S can be written in the form n m where m , n are coprime positive integers, find 1 0 0 m + 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.
a , b , c and d are non-negative. Equality occurs when ( 0 , 0 , 0 , 4 ) .
Log in to reply
What's wrong with what I said?
Log in to reply
The problem says "given that a , b , c , d are nonnegative real numbers" but your solution: "Equality occurs at ( a , 0 , 4 − a , 0 ) ".
Log in to reply
@Chew-Seong Cheong – Those are non-negative reals though...
Log in to reply
@Sharky Kesa – Sorry, I am lost.
Log in to reply
@Chew-Seong Cheong – My solution states all solutions of the form ( a , 0 , 4 − a , 0 ) and ( 0 , b , 0 , 4 − b ) satisfy, including your solution, which is b = 0 .
Log in to reply
@Sharky Kesa – Oh, I didn't see the 4 − a . I thought it was − a .
@Chew-Seong Cheong – Read "... and its cyclic variants"
Problem Loading...
Note Loading...
Set Loading...
Note that b 3 + 4 1 ≤ 4 1 , so b 3 + 4 a ≤ 4 a . Summing cyclically gives us b 3 + 4 a + c 3 + 4 b + d 3 + 4 c + a 3 + 4 d ≤ 4 a + 4 b + 4 c + 4 d = 1
Equality occurs at ( a , 0 , 4 − a , 0 ) and its cyclic variants. Thus, m = n = 1 , so 1 0 0 m + n = 1 0 1 .