Find the smallest value of a positive integer such that the global minimum of is also an integer.
Challenge: Solve without using calculus.
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.
Let F denote the expression in question. By completing the square,
5 F 0 0 = = = = 2 5 x 2 + 6 0 x y + 6 0 y 2 + 4 0 x + 4 k y + 3 5 ( 5 x + 6 y + 4 ) 2 + [ 2 4 y 2 + y ( − 4 8 + 5 k ) + 1 9 ] ( 5 x + 6 y + 4 ) 2 + 6 [ 4 y 2 + y ( 6 5 k − 8 ) + 6 1 9 ] ( 5 x + 6 y + 4 ) 2 + 6 ( 2 y + 2 4 5 k − 2 ) 2 − 9 6 5 ( 5 k 2 − 9 6 k + 9 6 )
Hence, F is minimized when 5 x + 6 y + 4 = 2 y + 2 4 5 k − 2 = 0 and has a minimum value of M : = − 9 6 5 k 2 − 9 6 k + 9 6 = − 9 6 5 k 2 + k − 1 .
For M to be an integer, it is sufficient for 5 k 2 to be divisible by 96. Since 5 is coprime to 96, then k 2 is divisible by 96.
Since 9 6 = 2 5 × 3 . Then min ( k ) = 2 ⌈ 5 / 2 ⌉ × 3 = 2 4 .
Upon substitution, F has a global minimum of − 7 when x = 1 , y = − 2 3 .
Here's a calculus solution:
Let F denote the expression in question. At its global minimum, the partial derivatives of F must be 0. That is,
∂ x ∂ F = 1 0 x + 1 2 y + 8 = 0 , ∂ y ∂ F = 1 2 x + 2 4 y + k = 0
which yield ( x , y ) = ( 8 k − 2 , 1 − 4 8 5 k )
Constructing the Hessian matrix shows that F is minimized at the coordinate stated above. Hence, min ( F ) = − 9 6 5 k 2 + k − 1
Trial and error shows that the smallest positive integer value of k such that min ( F ) is an integer is min ( k ) = 2 4 .