A family of ellipses is defined by the set of all ellipses whose equation is
a 2 x 2 + b 2 y 2 = 1
and passing through the point ( 3 , 4 ) . Find the smallest possible area of an ellipse in this family.
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.
Since the ellipse passes through ( 3 , 4 ) , the family of ellipses is a 2 9 + b 2 1 6 = 1 , which rearranges to b = a 2 − 9 4 a for a > b > 0 .
Since the area of the ellipse is A = π a b , it is A = a 2 − 9 4 π a 2 after substituting b .
The minimum area A occurs when the derivative A ′ = ( a 2 − 9 ) 2 3 4 π a ( a 2 − 1 8 ) = 0 and the second derivative A ′ ′ > 0 , which is at a = 3 2 for a > 0 .
If a = 3 2 , then A = ( 3 2 ) 2 − 9 4 π ( 3 2 ) 2 = 2 4 π .
Sir, I think it would be simpler to use AM-GM directly after your first line, i.e.
1 = a 2 9 + b 2 1 6 ≥ 2 a 2 b 2 9 ⋅ 1 6
which directly implies that a b ≥ 2 4
Log in to reply
Yes, very elegant!
Hey I did the same too! Of course, you still have to prove that this minimum value is attainable (when a 3 = b 4 ).
Log in to reply
Yeah of course, Sir!! I was just hinting at this trick....:P
Although, for completeness, we see that the minimum value is attained when a = 3 2 and b = 4 2 . This can be found by solving the equations a 2 9 + b 2 1 6 = 1 and a = 4 3 b ( E q u a l i t y c o n d i t i o n f o r A M − G M ) .
So, our desired ellipse is 1 8 x 2 + 3 2 y 2 = 1
Do you mean a , b > 0 instead of a > b > 0 ?
In this problem, b = 4 2 is greater than a = 3 2 .
We are required to minimise the function: f = π a b subject to the constraint: a 2 9 + b 2 1 6 = 1
The Lagrangian can be constructed as follows:
L = f + λ ( a 2 9 + b 2 1 6 − 1 )
Computing partial derivatives and equating to zero:
∂ a ∂ L = π b − a 3 1 8 λ = 0 ∂ b ∂ L = π a − b 3 3 2 λ = 0 ∂ λ ∂ L = a 2 9 + b 2 1 6 − 1 = 0
Multiplying the first equation by a and the second by b , adding them, and simplifying gives us: π a b = λ
Using this result in ( a ∂ a ∂ L = 0 ) and ( b ∂ b ∂ L = 0 ) and simplifying gives us:
a 2 = 1 8 b 2 = 3 2
From here, the required area can be computed to be π a b = 2 4 π
To check whether the value obtained is a minimum, additional checks (second derivative tests) need to be carried out. This has not been demonstrated in this solution.
An alternate approach to the problem would be to avoid multi-variable calculus altogether. Consider the curve: a 2 9 + b 2 1 6 = 1 This can be plotted on the a − b plane. Along with that, the rectangular hyperbola a b = c can be plotted by varying c. This looks as such:
We see that when a b = 2 4 or π a b = 2 4 π , the hyperbola just touches the constraint graph. The miminum value can be computed by finding the hyperbola tangential to the constraint. This is in fact, in a way, a geometrical interpretation of the Lagrange multiplier approach. An interested reader is encouraged to look up relevant sources on the intuition behind Lagrange multipliers.
Problem Loading...
Note Loading...
Set Loading...
Area of ellipse a 2 x 2 + b 2 y 2 = 1 is given by A = π a b . Therefore, A is minimum when a b is minimum. For an ellipse we can express { x = a cos θ y = b sin θ . Since the ellipse passes through the point ( 3 . 4 ) , { a cos θ = 3 b sin θ = 4 . ⟹ a b sin θ cos θ = 1 2 , ⟹ a b = sin θ cos θ 1 2 = sin 2 θ 2 4 .
Therefore, min ( A ) = min ( π a b ) = π min ( sin 2 θ 2 4 ) = max ( sin 2 θ ) 2 4 π = 2 4 π , when θ = 4 π .