Maths Olympiad Prep

Library / /51 of 61

Geometry Difficulty 6.4 National Olympiad Prove it Ibero-American Mathematical Olympiad

Problem:
A convex hexagon is called a unit if it has four diagonals of length 11, whose endpoints include all the vertices of the hexagon. Show that there is a unit of area kk for any 0<k10 < k \leq 1. What is the largest possible area for a unit?

Solution

Solution:
Answer: We can get arbitrarily close to (but not achieve) 334\dfrac{3 \sqrt{3}}{4} (approx 1.31.3) by:

Figure 1

To prove the first part, consider the diagram below. Take AB=AC=1AB = AC = 1 and BAC=2θ\angle BAC = 2\theta. Take DE=DF=1DE = DF = 1 and take the points of intersection XX and YY such that AX=DX=AY=DY=2/3AX = DX = AY = DY = 2/3. It is easy to check that the area of the hexagon is sin2θ\sin 2\theta. So by taking θ\theta in the interval (0,π/4](0, \pi/4] we can get any area 0<k10 < k \leq 1.

Figure 2

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

Figure 3

Consider case 1.

Figure 4

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

Figure 5

We obviously make AEBAEB a straight line. Now area ADEADE + area ADCADC = area ACEACE + area CDECDE. So if we regard every point except DD as fixed, then we maximise the area by taking EAD=CAD\angle EAD = \angle CAD, so that DD is the maximum distance from CECE. Thus a maximal configuration must have AED=CAD\angle AED = \angle CAD. Similarly, it must have CAD=CAB\angle CAD = \angle CAB, 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.

Figure 6

4
5
Figure 7
6
Figure 8

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 AB=AC=BD=1AB = AC = BD = 1). To optimise it, suppose ACB=θ\angle ACB = \theta. Area ABDC=ABDC = area ABCABC + area BCDBCD. If we fix θ\theta, then BCBC is fixed, so to maximise area BCDBCD we must take CBD=90\angle CBD = 90^\circ. But θ\theta cannot be optimal unless also CAD=90\angle CAD = 90^\circ. We have BA=BDBA = BD and hence BAD=BDA=45θ/2\angle BAD = \angle BDA = 45^\circ - \theta/2. Hence

90=CAD=BACBAD=(1802θ)(45θ/2) 90^\circ = \angle CAD = \angle BAC - \angle BAD = (180^\circ - 2\theta) - (45^\circ - \theta/2)

Hence θ=30\theta = 30^\circ. So ACD=BDC=60\angle ACD = \angle BDC = 60^\circ and CAB=ABD=120\angle CAB = \angle ABD = 120^\circ. It is easy to check that this has area 334\dfrac{3\sqrt{3}}{4}.

Figure 9

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.