sin 2 0 1 6 α + cos 2 0 1 6 α
Let α be a real number . If the minimum value of the expression above can be expressed as 2 n , find 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.
What's Holder's Inequality? :))
First, note that s i n 2 0 1 6 α and c o s 2 0 1 6 α are non-negative. For cases where either s i n α = 0 or c o s α = 0 , we have s i n 2 0 1 6 α + c o s 2 0 1 6 α = 1 . For positive values, we apply AM-GM inequality(?):
s i n 2 0 1 6 α + c o s 2 0 1 6 α ≥ 2 ⋅ s i n 1 0 0 8 α ⋅ c o s 1 0 0 8 α
We take the equality case for minimum value. This gives us s i n α = c o s α = 2 1 . By substitution, we have s i n 2 0 1 6 α + c o s 2 0 1 6 α = 2 1 0 0 7 1 . Hence n = − 1 0 0 7 .
Note that the minimum of 2 ⋅ s i n 1 0 0 8 α ⋅ c o s 1 0 0 8 α is actually 0, and occus when sin α = 0 or cos α = 0 . You have not demonstated yet that s i n 2 0 1 6 α + c o s 2 0 1 6 α ≥ 2 × 2 1 0 0 8 1 .
There is no reason why the minimum value of the RHS must occur at the equality case.
Problem Loading...
Note Loading...
Set Loading...
Let s i n α = x and c o s α = y , satisfying x 2 + y 2 = 1 . We are then looking to minimize x 2 0 1 6 + y 2 0 1 6 .
By Holder's inequality,
( ( 1 + 1 ) ( 1 + 1 ) ⋯ ( 1 + 1 ) ( x 2 0 1 6 + y 2 0 1 6 ) ) 1 0 0 8 1 ≥ x 1 0 0 8 2 0 1 6 + y 1 0 0 8 2 0 1 6
With 1 0 0 7 1 + 1 's in the LHS.
Simplifying gives us 2 1 0 0 7 ( x 2 0 1 6 + y 2 0 1 6 ) ≥ ( x 2 + y 2 ) 1 0 0 8 = 1 (since x 2 + y 2 = 1 )
Giving us x 2 0 1 6 + y 2 0 1 6 ≥ 2 1 0 0 7 1 = 2 − 1 0 0 7 .
So, our minimum value of s i n 2 0 1 6 α + c o s 2 0 1 6 α = x 2 0 1 6 + y 2 0 1 6 is 2 − 1 0 0 7 . We then get our answer as − 1 0 0 7 .