Let , , . The minimum and maximum values of are and . If can be written in the form , where and are positive, coprime integers, find .
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.
If we define F ( x , y , z ) = x y + x z + y z x 2 + y 2 + z 2 x ∈ [ 1 , 2 ] , y ∈ [ 2 , 3 ] , z ∈ [ 3 , 4 ] then ∂ x ∂ F = ( x y + x z + y z ) 2 ( y + z ) x 2 + 2 x y z − ( y + z ) ( y 2 + z 2 ) = ( x y + x z + y z ) 2 ( y + z ) ( x 2 − y 2 ) + z ( 2 x y − ( y + z ) z ) It is clear from this that ∂ x ∂ F ≤ 0 for x ≤ y ≤ z . Thus F will be maximized when x = 1 , and minimized then x = 2 . By symmetry, we also deduce that F will be maximized when z = 4 , and minimized when z = 3 .
To maximize F , we need to maximize g ( y ) = F ( 1 , y , 4 ) = 5 y + 4 y 2 + 1 7 2 ≤ y ≤ 3 Since g ′ ( y ) < 0 for all 2 ≤ y ≤ 3 , we deduce that the maximum value of F is M = g ( 2 ) = F ( 1 , 2 , 4 ) = 2 3 Similarly, to minimize F , we need to minimize h ( y ) = F ( 2 , y , 3 ) = 5 y + 6 y 2 + 1 3 2 ≤ y ≤ 3 Since h ′ ( y ) = ( 5 y + 6 ) 2 ( 5 y − 1 3 ) ( y + 5 ) we see that g is minimized when y = 5 1 3 , and hence the minimum value of F is m = g ( 5 1 3 ) = F ( 2 , 5 1 3 , 3 ) = 2 5 2 6 Thus M + m = 5 0 1 2 7 , making the answer 1 7 7 .