Maths Olympiad Prep

Library / /1 of 5

Geometry Difficulty 7.1 National olympiad, round 2 Prove it Bulgaria

Let XX be an interior point of ABC\triangle ABC and S1=SXBCS_1 = S_{XBC}, S2=SXCAS_2 = S_{XCA}, S3=SXABS_3 = S_{XAB}. Find the minimal area of a convex polygon, containing three segments equal and parallel to XAXA, XBXB, XCXC.

Solution

We may assume that S1S2S3S_1 \ge S_2 \ge S_3. We shall prove that the answer is S1S_1.
It is not difficult to see that the area of the convex hull of two segments d1d_1 and d2d_2 is not less than the area SS of a triangle with two sides equal and parallel to these segments. Indeed, if this hull is a triangle, two cases are possible. In the first case, the respective segments are sides and then the area is equal to SS. In the second case, we may assume that an interior point EE of ABC\triangle ABC is such that CE=d1CE = d_1 and AB=d2AB = d_2. Setting F=ABCEF = AB \cap CE, then
2SABC=ABCFsinCFBd1d2sinCFB=2S. 2S_{ABC} = AB \cdot CF \sin \angle CFB \ge d_1 d_2 \sin \angle CFB = 2S.

If the hull is a quadrilateral with diagonals the respective segments, then its area is equal to SS. It remains to consider the case when the hull is a quadrilateral with two opposite sides the respective segments. We may assume that points CC and DD on the sides BEBE and AEAE of ABE\triangle ABE are such that AD=d1AD = d_1 and BC=d2BC = d_2. Then
2SABCD=2SABE2SCDE=(AEBEDECE)sinAEB>ADBCsinAEB=2S. 2S_{ABCD} = 2S_{ABE} - 2S_{CDE} = (AE \cdot BE - DE \cdot CE) \sin \angle AEB > AD \cdot BC \sin \angle AEB = 2S.
Hence any convex polygon containing two segments equal and parallel to XBXB and XCXC, is not less than S1S_1.
Let now AA' be the symmetric point of AA with respect to XX, and DD be such that XBDCXBDC is a parallelogram. Then AA' lies either in BXD\triangle BXD, or in CXD\triangle CXD; for example, in BXD\triangle BXD. Since SXCA=S2S1S_{XCA'} = S_2 \le S_1, then AA' lies in BXD\triangle BXD. This triangle has area S1S_1 and contains three segments equal and parallel to XAXA, XBXB, XCXC.

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 and solution reproduced as published; topic and difficulty added by this site.