Difference between revisions of "Mock AIME 3 2006-2007 Problems/Problem 11"
(Add solution with lagrange multipliers) |
m (Clarify Lagrange multiplier solution) |
||
Line 44: | Line 44: | ||
Since <math>x^2+y^2\ge0</math>, <math>(x^2 + y^2)^2</math> will be minimized when <math>x^2 + y^2</math> is at its minimum. | Since <math>x^2+y^2\ge0</math>, <math>(x^2 + y^2)^2</math> will be minimized when <math>x^2 + y^2</math> is at its minimum. | ||
− | We construct the Lagrangian <math>\mathcal{L} = x^2 + y^2 - \lambda(x^2 - y^2 + 2xy - 6)</math> and seek points where its gradient is zero to get the three equations: | + | We construct the Lagrangian <math>\mathcal{L} = x^2 + y^2 - \lambda(x^2 - y^2 + 2xy - 6)</math> by taking our value to optimize and subtracting off <math>\lambda</math> times our constraint, which we've set equal to zero. Now we seek points where its gradient is zero to get the three equations: |
<cmath>2x - 2\lambda x - 2\lambda y = 0</cmath> | <cmath>2x - 2\lambda x - 2\lambda y = 0</cmath> | ||
<cmath>2y + 2\lambda y - 2\lambda x = 0</cmath> | <cmath>2y + 2\lambda y - 2\lambda x = 0</cmath> | ||
<cmath>x^2 - y^2 + 2xy - 6 = 0</cmath> | <cmath>x^2 - y^2 + 2xy - 6 = 0</cmath> | ||
− | Adding and subtracting the first two equations, dividing by two, and setting <math>\mu = 2\lambda</math> for convenience yields: | + | All that is left to do is trudge through the algebra and solve for <math>x^2+y^2</math>. Adding and subtracting the first two equations, dividing by two, and setting <math>\mu = 2\lambda</math> for convenience yields: |
<cmath>x + y = \mu x</cmath> | <cmath>x + y = \mu x</cmath> | ||
<cmath>x - y = \mu y</cmath> | <cmath>x - y = \mu y</cmath> |
Revision as of 16:04, 31 August 2020
Problem
If and are real numbers such that find the minimum value of .
Solution 1
Factoring the LHS gives .
Now converting to polar:
Since we want to find ,
Since we want the minimum of this expression, we need to maximize the denominator. The maximum of the sine function is 1
(one value of which produces this maximum is )
So the desired minimum is
Solution 2
Since , finding the minimum value of is similar to finding that of . Let , where is the minimum value. We can rewrite this as and . . . . We want this polynomial to factor in the form , where at least one of . ( If , the equations and have no real solutions). Since , both and , so .
We can now use the “discriminant” to determine acceptable values of . simplifies to . Therefore, the minimum value of .
<baker77>
Solution 3 (Lagrange Multipliers)
Since , will be minimized when is at its minimum. We construct the Lagrangian by taking our value to optimize and subtracting off times our constraint, which we've set equal to zero. Now we seek points where its gradient is zero to get the three equations: All that is left to do is trudge through the algebra and solve for . Adding and subtracting the first two equations, dividing by two, and setting for convenience yields: We will use the last three equations to solve for , then square the result for our answer. Squaring each equation involving and subtracting the results yields: Multiplying the two equations involving yields: This can be substituted into the the previous equation: Substituting this into our constraint yields: Now, returning to the first equation involving : QED. -eiis1000