Maths Olympiad Prep

Library / HMMT February /645 of 1302

HMMT February

Geometry Difficulty 5.3 AIME, harder Prove it United States

Problem:
Find the smallest possible area of an ellipse passing through (2,0)(2,0), (0,3)(0,3), (0,7)(0,7), and (6,0)(6,0).

Solution

Solution:
Let Γ\Gamma be an ellipse passing through A=(2,0)A=(2,0), B=(0,3)B=(0,3), C=(0,7)C=(0,7), D=(6,0)D=(6,0), and let P=(0,0)P=(0,0) be the intersection of ADAD and BCBC. Area of ΓArea of ABCD\frac{\text{Area of } \Gamma}{\text{Area of } ABCD} is unchanged under an affine transformation, so we just have to minimize this quantity over situations where Γ\Gamma is a circle and PAPD=13\frac{PA}{PD}=\frac{1}{3} and PBBC=37\frac{PB}{BC}=\frac{3}{7}. In fact, we may assume that PA=7PA=\sqrt{7}, PB=3PB=3, PC=7PC=7, PD=37PD=3\sqrt{7}. If ∠P=θ\angle P=\theta, then we can compute lengths to get
r=Area of ΓArea of ABCD=π32−207cos⁡θ+21cos⁡2θ97⋅sin⁡3θ r=\frac{\text{Area of } \Gamma}{\text{Area of } ABCD}=\pi \frac{32-20\sqrt{7}\cos\theta+21\cos^2\theta}{9\sqrt{7}\cdot\sin^3\theta}
Let x=cos⁡θx=\cos\theta. Then if we treat rr as a function of xx,
0=r′r=3x1−x2+42x−20732−20x7+21x2 0=\frac{r'}{r}=\frac{3x}{1-x^2}+\frac{42x-20\sqrt{7}}{32-20x\sqrt{7}+21x^2}
which means that 21x3−40x7+138x−207=021x^3-40x\sqrt{7}+138x-20\sqrt{7}=0. Letting y=x7y=x\sqrt{7} gives
0=3y3−40y2+138y−140=(y−2)(3y2−34y+70) 0=3y^3-40y^2+138y-140=(y-2)\left(3y^2-34y+70\right)
The other quadratic has roots that are greater than 7\sqrt{7}, which means that the minimum ratio is attained when cos⁡θ=x=y7=27\cos\theta=x=\frac{y}{\sqrt{7}}=\frac{2}{\sqrt{7}}. Plugging that back in gives that the optimum Area of ΓArea of ABCD\frac{\text{Area of } \Gamma}{\text{Area of } ABCD} is 28π381\frac{28\pi\sqrt{3}}{81}, so putting this back into the original configuration gives Area of Γ≥56π39\Gamma \geq \frac{56\pi\sqrt{3}}{9}. If you want to check on Geogebra, this minimum occurs when the center of Γ\Gamma is (83,73)\left(\frac{8}{3}, \frac{7}{3}\right).

Want a route through all this instead of an archive? The track puts 2,604 problems in a working order, from Junior Challenge level to the IMO shortlist.

Source: MathNet, licensed CC-BY-4.0. Statement reproduced verbatim; metadata (topic, difficulty) added by this project.