(I hate you, whosoever created the examination.) I have just had the test this morning, and the final problem stumps me, as always. This is a slightly altered version of that problem.
What is the minimum of the following expression?
x 4 − 8 x 2 − x + 3 x 2 − 6 x + 9 + 2 0 1 9
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 g ( x ) = 3 x 2 + 6 3 x then g ( 1 ) = 1 and g ′ ( x ) = ( 3 x 2 + 6 ) 2 3 1 8 > 0 and hence we deduce that g ( x ) < 1 for x < 1 , while g ( x ) > 1 for x > 1 . We now note that, if we define f ( x ) = x 4 − 8 x 2 − x + 3 x 2 − 6 x + 9 + 2 0 1 9 then f ( − x ) > f ( x ) for all x > 0 , so f is certainly minimized at nonnegative x . But f ′ ( x ) = 4 x 3 − 1 6 x − 1 + 3 x 2 − 6 x + 9 3 ( x − 1 ) = 4 x ( x 2 − 4 ) − 1 + g ( x − 1 ) so f ′ ( 2 ) = 0 and we deduce that f ′ ( x ) < 0 for 0 < x < 2 , while f ′ ( x ) > 0 for x > 2 . Thus the minimum value of f ( x ) occurs at x = 2 , and is therefore 2 0 0 4 .
Do you have an all-algebraic solution?
We do not need calculus to show that f must be minimized at nonegative x . Now x 4 − 8 x 2 3 x 2 − 6 x + 9 − ( x + 1 ) = ( x 2 − 4 ) 2 − 1 6 = 3 x 2 − 6 x + 9 + x + 1 2 x 2 − 8 x + 8 = 3 x 2 − 6 x + 9 + x + 1 2 ( x − 2 ) 2 both of these expressions are minimized (for x ≥ 0 ), taking values − 1 6 , 0 respectively at the point x = 2 . Thus f ( x ) ≥ − 1 6 + 0 + 2 0 2 0 = 2 0 0 4 as required.
One interesting note, not explanation, is that the answer to this problem is when I, and most of the students who took this test, were born, in 2004.
Does the solution have to be an integer?
Not necessarily.
I noticed your request that calculus not be used; unfortunately, that is the only method I know.
f = x 4 − 8 x 2 + 3 x 2 − 6 x + 9 − x + 2 0 1 9
∂ x ∂ f = 4 x 3 + 2 3 x 2 − 6 x + 9 6 x − 6 − 1 6 x − 1
Solve [ ∂ x ∂ f = 0 ] ⟹ { 2 . , − 1 . 9 1 4 6 7 , − 0 . 1 3 0 6 5 7 , 1 . 0 0 0 9 7 − 1 . 4 1 5 0 5 i , 1 . 0 0 0 9 7 + 1 . 4 1 5 0 5 i }
∂ x 2 ∂ 2 f @ { 2 . , − 1 . 9 1 4 6 7 , − 0 . 1 3 0 6 5 7 , 1 . 0 0 0 9 7 − 1 . 4 1 5 0 5 i , 1 . 0 0 0 9 7 + 1 . 4 1 5 0 5 i } ⟹ { 3 2 . 6 6 6 7 , 2 8 . 0 9 3 4 , − 1 5 . 2 1 1 6 , − 1 5 3 2 8 . − 4 4 4 9 . 7 5 i , − 1 5 3 2 8 . + 4 4 4 9 . 7 5 i }
As only the first two have positive real valuses, they are the local minimums.
f @ { 2 . , − 1 . 9 1 4 6 7 , − 0 . 1 3 0 6 5 7 , 1 . 0 0 0 9 7 − 1 . 4 1 5 0 5 i , 1 . 0 0 0 9 7 + 1 . 4 1 5 0 5 i } ⟹ { 2 0 0 4 . , 2 0 1 0 . 6 4 , 2 0 2 2 . 1 3 , 2 0 1 9 . 0 2 + 2 9 . 6 5 1 1 i , 2 0 1 9 . 0 2 − 2 9 . 6 5 1 1 i }
Of the first two (the local minimums), the first at x = 2 where f ( 2 ) = 2 0 0 4 is the smallest and is therefore the global minimum.
Problem Loading...
Note Loading...
Set Loading...
We have 2 ( x − 2 ) 2 = 2 x 2 − 8 x + 8 ≥ 0 , with equality for x = 2 . Thus 3 x 2 − 6 x + 9 ≥ x 2 + 2 x + 1 = ( x + 1 ) 2 and 3 x 2 − 6 x + 9 ≥ x + 1 . The quantity to be minimised is ( x 2 − 4 ) 2 − x + 3 x 2 − 6 x + 9 + 2 0 0 3 ≥ ( x 2 − 4 ) 2 + 2 0 0 4 , with the minimum of 2 0 0 4 being attained at x = 2 .