Let $ABCDEF$ be a convex hexagon of area $1$, whose opposite sides are parallel. The lines $AB$, $CD$ and $EF$ meet in pairs to determine the vertices of a triangle. Similarly, the lines $BC$, $DE$ and $FA$ meet in pairs to determine the vertices of another triangle. Show that the area of at least one of these two triangles is at least $3/2$.
Problem
Source: Balkan Mathematical Olympiad 2011. Problem 4.
Tags: inequalities, geometry, LaTeX, ratio, trigonometry, geometry proposed
08.05.2011 10:32
This looks too simple for a problem 4 in BMO, please check my solution.
PS: sorry, I can't use latex now.
08.05.2011 10:52
Quite correct; this approach (ratios of the segments, and ratios of areas expressed in terms of those) is quickly leading to the answer. The official solution works on showing that if we "fold" the six small triangles (created around the hexagon) towards the hexagon, they will cover it, so one of the two sets of three triangles belonging to each of the two large triangles will have an area of at least $1/2$ that of the hexagon.
08.05.2011 14:23
Does anyone know anything about the results? Thank you!
08.05.2011 18:17
mavropnevma wrote: Quite correct; this approach (ratios of the segments, and ratios of areas expressed in terms of those) is quickly leading to the answer. The official solution works on showing that if we "fold" the six small triangles (created around the hexagon) towards the hexagon, they will cover it, so one of the two sets of three triangles belonging to each of the two large triangles will have an area of at least $1/2$ that of the hexagon. Could you please post here the official solution?
11.05.2011 11:29
Here is my solution to this problem: First of all, notice that all the triangles in this figure are similar. Let $\Delta$ be the triangle with maximal area $K$, $\Delta'$ be the other big triangle with area $k'^2K$ where $k'\leq1$ is the ratio of similarity with respect to $\Delta$ and $k_1,k_2,\ldots,k_6$ are the ratio of similarity of the small triangles with respect to $\Delta$. The small triangles are ordered such that $\Delta_1,\Delta_2,\Delta_3$ are adjacent to one side of the triangle $\Delta$. We have the relations (the sum of sides of 3 small triangles=the side of a big triangle): $k_1+k_2+k_3=k_3+k_4+k_5=k_5+k_6+k_1=1$ and $k_2+k_3+k_4=k_4+k_5+k_6=k_6+k_1+k_2=k'$. and for the areas: $K+k'^2K=(k_1^2+\cdots+k_6^2)K+2$ which gives $K=\frac{2}{1+k'^2-(k_1^2+\cdots+k_6^2)}$. We want to prove that $K\geq 3/2$ which is equivalent to $3\sum k_i^2\geq3k'^2-1$. But: \[\begin{array}{lcl} 3\sum k_i^2&=&(k_1^2+k_2^2+k_3^2)+(k_2^2+k_3^2+k_4^2)+\cdots+(k_6^2+k_1^2+k_2^2)\\ &\geq&\frac{1}{3}(k_1+k_2+k_3)^2+\frac{1}{3}(k_2+k_3+k_4)^2+\cdots+\frac{1}{3}(k_6+k_1+k_2)^2\\ &=&1+k'^2\geq3k'^2-1 \end{array}\] since $k'\leq1$ and we are done. Clearly, this is easy for a problem 4.
16.05.2011 08:22
Isn't it this?
16.05.2011 09:30
Sure enough, your Hexagram topic is fully equivalent to this problem. It would be interesting if you could reveal from what source you got the problem of your initial post? this in no way points to plagiarism re the BMO problem, since same mathematical truths may be (and are) re-discovered.
16.05.2011 23:13
To be honest, I was just playing with geogebra and discovered the fact. I'm also pretty sure that the proposer in no way create any kind of plagiarism by propose this problem, but I think the problem committee should be more thorough in selecting the problems. This forum is - in my opinion - the best source for training problems, so the last problem of this year's BMO would likely be a 'Yeah! I've seen this problem - on Mathlinks!'.
22.06.2011 19:03
23.01.2025 08:39
Suppose the opposite. Let the points \( P, Q, R, S, T, U \) be the intersections of the following lines: \[ (AB, CD), (CD, EF), (EF, AB), (DE, FA), (FA, BC), (BC, DE). \]Note that triangles \( PQR \) and \( STU \) are similar, with \( PQR \) being the smaller one. Let \[ \frac{SE}{SU} = p, \quad \frac{SF}{ST} = p, \quad \frac{UD}{US} = q, \quad \frac{UC}{UT} = q, \quad \frac{TA}{TS} = r, \quad \frac{TB}{TU} = r. \]If the area of triangle \( STU \) is \( L \), then we have the relation: \[ \text{Area of } ABCDEF = L(1 - p^2 - q^2 - r^2) = 1. \]Since we assume \( L < \frac{3}{2} \), it follows that: \[ p^2 + q^2 + r^2 < \frac{1}{3}. \]Note that: \[ \frac{DE}{PR} \geq (1 - p - q), \quad \text{etc.} \]Analogously, we get the inequality: \[ (1 - p - q)^2 + (1 - q - r)^2 + (1 - r - p)^2 < \frac{1}{3}. \] Let: \[ a = p + q, \quad b = q + r, \quad c = r + p. \]Then: \[ \sum a^2 \leq 4(p^2 + q^2 + r^2) < \frac{4}{3}, \]and: \[ \sum (1 - a)^2 < \frac{1}{3}. \] By the Cauchy-Schwarz inequality: \[ a + b + c \leq \sqrt{3 \sum a^2}. \]Let: \[ \sqrt{3 \sum a^2} = x. \] Thus: \[ \frac{1}{3} > \sum (1 - 2a + a^2) > 3 - 2x + \frac{x^2}{3}. \] From this, we get: \[ 2 < x < 4, \]which leads to the contradiction: \[ \sum a^2 > \frac{4}{3}. \]solution of: jgnr in LATEX
23.01.2025 09:39
So here is my motivation. Let $X, Y, Z, P, Q, R$ be the intersection of the sides $(AB,EF)$, $(AB,CD)$, $(DC,EF)$, $(AF,ED)$, $(AF,BC)$, $(BC,ED)$, respectively. Let $S$ be the area of the hexagon. Then we need to prove that at least one of the triangles $XYZ$ and $PQR$ have at least $3/2*S$ area. Since these triangles are similar, we can assume that one of them is bigger. Let's say $XYZ$. Then we can enlarge the $PQR$ until it becomes equal to &XYZ& by enlarging some of the sides. But this operation enlarges the $S$, but bigger triangle's area didn't changed, so from here we can deduce that in the worst case when these two triangles are equal. So it suffices to solve problem when $PQR$ and $XYZ$ are equal. (So that's trivial i guess)
23.01.2025 09:39
Another solution using stronger fact. Let $X, Y, Z, P, Q, R$ be the intersection of the sides $(AB,EF)$, $(AB,CD)$, $(DC,EF)$, $(AF,ED)$, $(AF,BC)$, $(BC,ED)$, respectively. Let $S$ be the area of the hexagon. And $x,y,z,p,q,r$ be the areas of $XAF, YBC, EDZ, PEF, QAB, RCD$. Then single claim finishes our problem. Claim: $q+y+r\geq S(ABCD)$. Proof: Let $ AB=m*BY $, $ CD=n*CY $ . Then it's suffices to show that: $ 1+m^2+n^2\geq mn+m+n $, which is trivial. So using this claim: $q+y+r\geq S(ABCD)$ and $x+p+z\geq S(AFED)$ which implies that $x+y+z+p+q+r\geq S(ABCDEF)=S$. So one of the sums $x+y+z$ and $p+q+r$ is at least $S/2$, which finishes the problem.