Problem:
Suppose Harvard Yard is a square. There are 14 dorms located on the perimeter of the Yard. If is the minimum distance between two dorms, the maximum possible value of can be expressed as where are positive integers. Compute .
Problem:
Suppose Harvard Yard is a square. There are 14 dorms located on the perimeter of the Yard. If is the minimum distance between two dorms, the maximum possible value of can be expressed as where are positive integers. Compute .
Solution:
If two neighboring dorms are separated by a distance of more than , we can move them slightly closer together and adjust the other dorms, increasing . Therefore, in an optimal arrangement, the dorms form an equilateral 14-gon with side length .
By scaling, the problem is now equivalent to finding the smallest such that there exist 14 vertices on the boundary of an square that form an equilateral 14-gon with side length 1. Such a 14-gon must be centrally symmetric, yielding the following picture:

We know that and . Moreover, if these equations are satisfied, then such a 14-gon exists. We now consider the vectors and . These unit vectors are in the first quadrant and add to , which lies on the line .

Since and must lie on the first quadrant, from the above diagram we deduce that the minimum value of occurs when one of is , meaning that . This means that , so the maximum possible value of is