Consider all segments dividing the area of a triangle $ABC$ in two equal parts. Find the length of the shortest segment among them, if the side lengths $a,$ $b,$ $c$ of triangle $ABC$ are given. How many of these shortest segments exist ?
Problem
Source: IMO LongList 1959-1966 Problem 47
Tags: geometry, trigonometry, area of a triangle, counting, combinatorics, IMO Longlist, IMO Shortlist
07.09.2004 02:37
Please post your solutions. This is just a solution template to write up your solutions in a nice way and formatted in LaTeX. But maybe your solution is so well written that this is not required finally. For more information and instructions regarding the ISL/ILL problems please look here: introduction for the IMO ShortList/LongList project and regardingsolutions
16.12.2005 01:56
http://www.mathlinks.ro/Forum/viewtopic.php?p=336213#336213 if $a>b>c$, there are two segments $PQ,P'Q$, with equal lenghts: $P,P' \in a$ $Q,Q' \in b$ $CP=CQ'$ $CP'=CQ$ so, the segments $PQ,P'Q'$ are symmetric through the bisector of $\angle C$
17.12.2005 19:32
For $D\in \{A,B,C\}$ I note $DP=x$, $DQ=y$ and $\frac 12 xy\sin D=\frac 12 S$, i.e. $xy=k$ (constant). But $PQ^2=x^2+y^2-2xy\cos D$. Therefore, $PQ$ is minimum $\Longleftrightarrow x^2+y^2$ is minimum ($xy$ - constant) $\Longleftrightarrow$ $x=y=\sqrt{\frac{S}{\sin D}}$ a.s.o.
17.12.2005 22:19
Nice and quick proof! Why should we check three cases? We don't want to find a minimum segment for every angle, but for the entrire triangle. I think that the smallest segment corresponds to the smallest angle of the triangle
17.12.2005 23:51
YES ! Prove easily that $\min PQ=\min_{D\in \{A,B,C\}} \sqrt{2S\tan \frac D2}=\sqrt{2S\tan \frac{\min \{A,B,C\}}{2}}.$ Remark. In my opinion, although this problem is nicely, the its level is ** (from ******).