Maths Olympiad Prep

Library / /186 of 397

, 2022

Geometry Difficulty 5.8 AIME, harder Prove it Taiwan

Given a positive integer nn. Let SS be the set of points in the coordinate plane whose xx-coordinate and yy-coordinate are both nonnegative integers less than 2n2n (so SS contains a total of 4n24n^2 points). Suppose F\mathcal{F} is a set of n2n^2 quadrilaterals, where every vertex of each quadrilateral lies in SS, and every point in SS is a vertex of one of the quadrilaterals in F\mathcal{F}. Find the maximum possible value of the sum of the areas of all n2n^2 quadrilaterals in F\mathcal{F}.

Solution

The maximum possible value of the sum of the areas is Σ(n)=13n2(2n+1)(2n1)\Sigma(n) = \frac{1}{3}n^2(2n+1)(2n-1).

Below, let [P][P] denote the area of the polygon PP. We first make some conventions. If all the vertices of a polygon belong to SS, we call it legal. Let O=(n12,n12)O = (n - \frac{1}{2}, n - \frac{1}{2}) be the center point of SS. If a legal square has center OO, we call that square centered. Finally, if a set of polygons F\mathcal{F} satisfies the conditions of the problem, we call F\mathcal{F} admissible, and denote the sum of its areas by Σ(F)\Sigma(\mathcal{F}).

Every point in SS is exactly the vertex of a unique centered square. So all the centered squares form an admissible set G\mathcal{G}. Below we prove that
Σ(F)Σ(G)=Σ(n)(1) \Sigma(\mathcal{F}) \le \Sigma(\mathcal{G}) = \Sigma(n) \qquad (1)
holds for every admissible F\mathcal{F}, which thus answers the problem.

We use the following key lemma.

Lemma 1. Let P=A1A2AmP = A_1A_2\dots A_m be a polygon, and let OO be an arbitrary point in the plane. Then
[P]12i=1mOAi2;(2) [P] \le \frac{1}{2} \sum_{i=1}^{m} OA_i^2; \qquad (2)
and moreover, when PP is a square and OO is its center, the inequality in (2) becomes an equality.

Proof of Lemma. Let Pn+1=P1P_{n+1} = P_1. For each i=1,2,,mi = 1, 2, \dots, m, we have
[OAiAi+1]OAiOAi+12OAi2+OAi+124. [OA_iA_{i+1}] \le \frac{OA_i \cdot OA_{i+1}}{2} \le \frac{OA_i^2 + OA_{i+1}^2}{4}.
Thus we obtain
[P]i=1m[OAiAi+1]14i=1m(OAi2+OAi+12)=12i=1mOAi2, [P] \le \sum_{i=1}^{m} [OA_iA_{i+1}] \le \frac{1}{4} \sum_{i=1}^{m} (OA_i^2 + OA_{i+1}^2) = \frac{1}{2} \sum_{i=1}^{m} OA_i^2,
which is exactly (2). Direct verification shows that when PP is a square and OO is its center, the inequality in (2) becomes an equality. This proves the lemma. \square

Σ(F)12ASOA2=Σ(G), \Sigma(\mathcal{F}) \le \frac{1}{2} \sum_{A \in \mathcal{S}} OA^2 = \Sigma(\mathcal{G}),
so the left-hand inequality of (1) holds.

Finally, we compute Σ(G)\Sigma(\mathcal{G}). From (2) we know
Σ(G)=12ASOA2=12i=02n1j=02n1((n12i)2+(n12j)2)=1842ni=0n1(2n2i1)2=nj=0n1(2j+1)2=n2(2n+1)(2n1)3=Σ(n). \begin{align*} \Sigma(\mathcal{G}) &= \frac{1}{2} \sum_{A \in \mathcal{S}} OA^2 = \frac{1}{2} \sum_{i=0}^{2n-1} \sum_{j=0}^{2n-1} \left( \left( n - \frac{1}{2} - i \right)^2 + \left( n - \frac{1}{2} - j \right)^2 \right) \\ &= \frac{1}{8} \cdot 4 \cdot 2n \sum_{i=0}^{n-1} (2n - 2i - 1)^2 \\ &= n \sum_{j=0}^{n-1} (2j + 1)^2 \\ &= \frac{n^2(2n + 1)(2n - 1)}{3} = \Sigma(n). \end{align*}
This completes the proof.

\Box

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 translated into English from zh; metadata (topic, difficulty) added by this project.