Maths Olympiad Prep

Library / /1386 of 1394

, 2022

Geometry Difficulty 6.4 National Olympiad Prove it United States

Problem:

Let A1B1C1A_{1} B_{1} C_{1}, A2B2C2A_{2} B_{2} C_{2}, and A3B3C3A_{3} B_{3} C_{3} be three triangles in the plane. For 1i31 \leq i \leq 3, let DiD_{i}, EiE_{i}, and FiF_{i} be the midpoints of BiCiB_{i} C_{i}, AiCiA_{i} C_{i}, and AiBiA_{i} B_{i}, respectively. Furthermore, for 1i31 \leq i \leq 3 let GiG_{i} be the centroid of AiBiCiA_{i} B_{i} C_{i}.
Suppose that the areas of the triangles A1A2A3A_{1} A_{2} A_{3}, B1B2B3B_{1} B_{2} B_{3}, C1C2C3C_{1} C_{2} C_{3}, D1D2D3D_{1} D_{2} D_{3}, E1E2E3E_{1} E_{2} E_{3}, and F1F2F3F_{1} F_{2} F_{3} are 2,3,4,20,212, 3, 4, 20, 21, and 20202020, respectively. Compute the largest possible area of G1G2G3G_{1} G_{2} G_{3}.

Solution

Solution:

Let Pi(x,y,z)P_{i}(x, y, z) be the point with barycentric coordinates (x,y,z)(x, y, z) in triangle AiBiCiA_{i} B_{i} C_{i}. Note that since this is linear in x,yx, y, and zz, the signed area of triangle P1(x,y,z)P2(x,y,z)P3(x,y,z)P_{1}(x, y, z) P_{2}(x, y, z) P_{3}(x, y, z) is a homogenous quadratic polynomial in x,yx, y, and zz; call it f(x,y,z)f(x, y, z).
We now claim that
f(13,13,13)=4f(12,12,0)+4f(12,0,12)+4f(0,12,12)f(1,0,0)f(0,1,0)f(0,0,1)9 f\left(\frac{1}{3}, \frac{1}{3}, \frac{1}{3}\right)=\frac{4 f\left(\frac{1}{2}, \frac{1}{2}, 0\right)+4 f\left(\frac{1}{2}, 0, \frac{1}{2}\right)+4 f\left(0, \frac{1}{2}, \frac{1}{2}\right)-f(1,0,0)-f(0,1,0)-f(0,0,1)}{9}
This is easy to verify for f{x2,y2,z2,xy,xz,yz}f \in\{x^{2}, y^{2}, z^{2}, x y, x z, y z\}, after which the statement follows for general ff by linearity. Then, assuming that we can arbitrarily choose the signs of the areas, the area is maximized at
42061+99=2294+1=917 \frac{4 \cdot 2061+9}{9}=229 \cdot 4+1=917
Now it remains to show that this best-case scenario is actually possible. The first step is to first show that these values from an actual ff, i.e. that one can fit a homogenous quadratic polynomial through every six possible values for ff at the six given points. One way to see this is to note that by choosing the coefficients for x2,y2x^{2}, y^{2}, and z2z^{2}, the values at the vertices of the triangle can be matched, while adding any of the xy,xzx y, x z, and yzy z terms influences only one of the midpoints, so they can be matched as well.
Now we show that this particular ff can be realized by a choice of triangles. To do this, note that by continuity there must exist x0,y0x_{0}, y_{0}, and z0z_{0} with f(x0,y0,z0)=0f\left(x_{0}, y_{0}, z_{0}\right)=0, since f(1,0,0)f(1,0,0) and f(12,12,0)f\left(\frac{1}{2}, \frac{1}{2}, 0\right) are different signs, and introduce the new coordinates u=xx0u=x-x_{0} and v=yy0v=y-y_{0}; then ff can be written as au2+buv+cv2+du+eva u^{2}+b u v+c v^{2}+d u+e v. Now, one can let P1(u,v)=(0,0)P_{1}(u, v)=(0,0), P2(u,v)=(u,v)P_{2}(u, v)=(u, v), and P3(u,v)=(cve,au+bv+d)P_{3}(u, v)=(-c v-e, a u+b v+d). This can be shown to reproduce the desired ff.
Finally, to address the condition that the original triangles must be nondegenerate, we can perturb each of the PiP_{i} by a constant, which doesn't affect ff as areas are translation-invariant. This concludes the proof.

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

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