Maths Olympiad Prep

Library / /19 of 62

, 2020

Geometry Difficulty 4.7 AIME Find the answer United States

Problem:

Suppose Harvard Yard is a 17×1717 \times 17 square. There are 14 dorms located on the perimeter of the Yard. If ss is the minimum distance between two dorms, the maximum possible value of ss can be expressed as aba-\sqrt{b} where a,ba, b are positive integers. Compute 100a+b100 a+b.

A number or a short expression. Fractions can be typed as 3/2, and spacing doesn't matter.

Solution

Solution:

If two neighboring dorms are separated by a distance of more than ss, we can move them slightly closer together and adjust the other dorms, increasing ss. Therefore, in an optimal arrangement, the dorms form an equilateral 14-gon with side length ss.

By scaling, the problem is now equivalent to finding the smallest aa such that there exist 14 vertices on the boundary of an a×aa \times a square that form an equilateral 14-gon with side length 1. Such a 14-gon must be centrally symmetric, yielding the following picture:

Figure 1

We know that x12+y12=x22+y22=1x_{1}^{2}+y_{1}^{2}=x_{2}^{2}+y_{2}^{2}=1 and x1+x2+3=y1+y2+2=ax_{1}+x_{2}+3=y_{1}+y_{2}+2=a. Moreover, if these equations are satisfied, then such a 14-gon exists. We now consider the vectors v1=(x1,y1)\vec{v}_{1}=\left(x_{1}, y_{1}\right) and v2=(x2,y2)\vec{v}_{2}=\left(x_{2}, y_{2}\right). These unit vectors are in the first quadrant and add to (a3,a2)(a-3, a-2), which lies on the line y=x+1y=x+1.

Figure 2

Since v1\vec{v}_{1} and v2\vec{v}_{2} must lie on the first quadrant, from the above diagram we deduce that the minimum value of aa occurs when one of v1,v2\vec{v}_{1}, \vec{v}_{2} is (0,1)(0,1), meaning that (a3,a2)=(22,22+1)(a-3, a-2)=\left(\frac{\sqrt{2}}{2}, \frac{\sqrt{2}}{2}+1\right). This means that a=22+3a=\frac{\sqrt{2}}{2}+3, so the maximum possible value of ss is
1722+3=1732217/2=62 \frac{17}{\frac{\sqrt{2}}{2}+3}=17 \cdot \frac{3-\frac{\sqrt{2}}{2}}{17 / 2}=6-\sqrt{2}

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.