Problem:
A convex hexagon is called a unit if it has four diagonals of length , whose endpoints include all the vertices of the hexagon. Show that there is a unit of area for any . What is the largest possible area for a unit?
Solution
Solution:
Answer: We can get arbitrarily close to (but not achieve) (approx ) by:

To prove the first part, consider the diagram below. Take and . Take and take the points of intersection and such that . It is easy to check that the area of the hexagon is . So by taking in the interval we can get any area .

It is easy to check that there are six possible configurations for the unit diagonals, as shown in the diagram below.

Consider case 1.

The area of the hexagon is area + area + area . The part of the segment that lies inside is wasted. The rest goes to provide height for the triangles on bases and . So area + area can be maximised by taking close to and as close to a right angle as possible, so that the height of the triangle (on the base ) is as large as possible. We can then get arbitrarily close to the area of:

We obviously make a straight line. Now area + area = area + area . So if we regard every point except as fixed, then we maximise the area by taking , so that is the maximum distance from . Thus a maximal configuration must have . Similarly, it must have , so all three angles must be equal. That disposes of case 1.
In cases 2 and 6 we find by a similar (but more tedious argument) the same maximum, although in one case we have to use the argument at the end for the final optimisation. In the other cases the maximum is smaller.

4
5
6
However, all these details would take an already long solution way over length. Does anyone have a better approach?
No. 6 (second case) can be made arbitrarily close to the figure below (with ). To optimise it, suppose . Area area + area . If we fix , then is fixed, so to maximise area we must take . But cannot be optimal unless also . We have and hence . Hence
Hence . So and . It is easy to check that this has area .
