Let $A,B$ be adjacent vertices of a regular $n$-gon ($n\ge5$) with center $O$. A triangle $XYZ$, which is congruent to and initially coincides with $OAB$, moves in the plane in such a way that $Y$ and $Z$ each trace out the whole boundary of the polygon, with $X$ remaining inside the polygon. Find the locus of $X$.

A farmer wants to create a rectangular plot along the side of a barn where the barn forms one side of the rectangle and a fence forms the other three sides. The farmer will build the fence by tting together $75$ straight sections of fence which are each $4$ feet long. The farmer will build the fence to maximize the area of the rectangular plot. Find the length in feet along the side of the barn of this rectangular plot.

Let $ ABC$ be an equilateral triangle with side length 2, and let $ \Gamma$ be a circle with radius $ \frac {1}{2}$ centered at the center of the equilateral triangle. Determine the length of the shortest path that starts somewhere on $ \Gamma$, visits all three sides of $ ABC$, and ends somewhere on $ \Gamma$ (not necessarily at the starting point). Express your answer in the form of $ \sqrt p \minus{} q$, where $ p$ and $ q$ are rational numbers written as reduced fractions.

Let $\triangle ABC$ be an acute-angled triangle with $AB \not= AC$. Let $H$ be the orthocenter of triangle $ABC$, and let $M$ be the midpoint of the side $BC$. Let $D$ be a point on the side $AB$ and $E$ a point on the side $AC$ such that $AE=AD$ and the points $D$, $H$, $E$ are on the same line. Prove that the line $HM$ is perpendicular to the common chord of the circumscribed circles of triangle $\triangle ABC$ and triangle $\triangle ADE$.

Let $ABC$ be an acute triangle and $M$ be the midpoint of $AB$. A circle through the points $B$ and $C$ intersects the segments $CM$ and $BM$ at points $P$ and $Q$ respectively. Point $K$ is symmetric to $P$ with respect to point $M$. The circumcircles of $\triangle AKM$ and $\triangle CQM$ intersect for the second time at $X$. The circumcircles of $\triangle AMC$ and $\triangle KMQ$ intersect for the second time at $Y$. The segments $BP$ and $CQ$ intersect at point $T$. Prove that the line $MT$ is tangent to the circumcircle of $\triangle MXY$.

Let $k$ be a positive integer and $P$ a point in the plane. We wish to draw lines, none passing through $P$, in such a way that any ray starting from $P$ intersects at least $k$ of these lines. Determine the smallest number of lines needed.

Let $ABC$ be an acute, scalene triangle with circumcenter $O$ and symmedian point $K$. Let $X$ be the point on the circumcircle of triangle $BOC$ such that $\angle AXO = 90^\circ$. Assume that $X\neq K$. The hyperbola passing through $B$, $C$, $O$, $K$, and $X$ intersects the circumcircle of triangle $ABC$ at points $U$ and $V$, distinct from $B$ and $C$. Prove that $UV$ is the perpendicular bisector of $AX$. [i]The symmedian point of triangle $ABC$ is the intersection of the reflections of $B$-median and $C$-median across the angle bisectors of $\angle ABC$ and $\angle ACB$, respectively.[/i] [i]Pitchayut Saengrungkongka[/i]

Given a point $O$ and lengths $x, y, z$, prove that there exists an equilateral triangle $ABC$ for which $OA = x, OB = y, OC = z$, if and only if $x+y \geq z, y+z \geq x, z+x \geq y$ (the points $O,A,B,C$ are coplanar).

Let $ABC$ be a triangle with $\angle B=90$. The incircle of $ABC$ touches the side $BC$ at $D$. The incenters of triangles $ABD$ and $ADC$ are $X$ and $Z$ , respectively. The lines $XZ$ and $AD$ are intersecting at the point $K$. $XZ$ and circumcircle of $ABC$ are intersecting at $U$ and $V$. Let $M$ be the midpoint of line segment $[UV]$ . $AD$ intersects the circumcircle of $ABC$ at $Y$ other than $A$. Prove that $|CY|=2|MK|$ .

A polygon $A$ that doesn't intersect itself and has perimeter $p$ is called [b]Rotund[/b] if for each two points $x,y$ on the sides of this polygon which their distance on the plane is less than $1$ their distance on the polygon is at most $\frac{p}{4}$. (Distance on the polygon is the length of smaller path between two points on the polygon) Now we shall prove that we can fit a circle with radius $\frac{1}{4}$ in any rotund polygon. The mathematicians of two planets earth and Tarator have two different approaches to prove the statement. In both approaches by "inner chord" we mean a segment with both endpoints on the polygon, and "diagonal" is an inner chord with vertices of the polygon as the endpoints. [b]Earth approach: Maximal Chord[/b] We know the fact that for every polygon, there exists an inner chord $xy$ with a length of at most 1 such that for any inner chord $x'y'$ with length of at most 1 the distance on the polygon of $x,y$ is more than the distance on the polygon of $x',y'$. This chord is called the [b]maximal chord[/b]. On the rotund polygon $A_0$ there's two different situations for maximal chord: (a) Prove that if the length of the maximal chord is exactly $1$, then a semicircle with diameter maximal chord fits completely inside $A_0$, so we can fit a circle with radius $\frac{1}{4}$ in $A_0$. (b) Prove that if the length of the maximal chord is less than one we still can fit a circle with radius $\frac{1}{4}$ in $A_0$. [b]Tarator approach: Triangulation[/b] Statement 1: For any polygon that the length of all sides is less than one and no circle with radius $\frac{1}{4}$ fits completely inside it, there exists a triangulation of it using diagonals such that no diagonal with length more than $1$ appears in the triangulation. Statement 2: For any polygon that no circle with radius $\frac{1}{4}$ fits completely inside it, can be divided into triangles that their sides are inner chords with length of at most 1. The mathematicians of planet Tarator proved that if the second statement is true, for each rotund polygon there exists a circle with radius $\frac{1}{4}$ that fits completely inside it. (c) Prove that if the second statement is true, then for each rotund polygon there exists a circle with radius $\frac{1}{4}$ that fits completely inside it. They found out that if the first statement is true then the second statement is also true, so they put a bounty of a doogh on proving the first statement. A young earth mathematician named J.N., found a counterexample for statement 1, thus receiving the bounty. (d) Find a 1392-gon that is counterexample for statement 1. But the Tarators are not disappointed and they are still trying to prove the second statement. (e) (Extra points) Prove or disprove the second statement. Time allowed for this problem was 150 minutes.

On the side $AB$ of the triangle $ABC$ mark the point $K$. The segment $CK$ intersects the median $AM$ at the point $F$. It is known that $AK = AF$. Find the ratio $MF: BK$.

On a rectangular piece of paper there are (a) several marked points all on one straight line, (b) three marked points (not necessarily on a straight line). We are allowed to fold the paper several times along a straight line not containing marked points and then puncture the folded paper with a needle. Show that this can be done so that after the paper has been unfolded all the marked points are punctured and there are no extra holes. (A Shapovalov)

In the triangle $ ABC$ let $ D$ and $ E$ be the boundary points of the incircle with the sides $ BC$ and $ AC$. Show that if $ AD\equal{}BE$ holds, then the triangle is isoceles.

Prove that any rigid flat triangle $T$ of area less than $4$ can be inserted through a triangular hole $Q$ with area $3$.

Let $ P$ be the the isogonal conjugate of $ Q$ with respect to triangle $ ABC$, and $ P,Q$ are in the interior of triangle $ ABC$. Denote by $ O_{1},O_{2},O_{3}$ the circumcenters of triangle $ PBC,PCA,PAB$, $ O'_{1},O'_{2},O'_{3}$ the circumcenters of triangle $ QBC,QCA,QAB$, $ O$ the circumcenter of triangle $ O_{1}O_{2}O_{3}$, $ O'$ the circumcenter of triangle $ O'_{1}O'_{2}O'_{3}$. Prove that $ OO'$ is parallel to $ PQ$.

Triangle $\triangle ABC$ has circumcenter $O$ and incircle $\gamma$. Suppose that $\angle BAC =60^\circ$ and $O$ lies on $\gamma$. If \[ \tan B \tan C = a + \sqrt{b} \] for positive integers $a$ and $b$, compute $100a+b$. [i]Proposed by Kaan Dokmeci[/i]

Consider a regular $n$-gon with $n$ odd. Given two adjacent vertices $A_{1}$ and $A_{2},$ define the sequence $(A_{k})$ of vertices of the $n$-gon as follows: For $k\ge 3,\, A_{k}$ is the vertex lying on the perpendicular bisector of $A_{k-2}A_{k-1}.$ Find all $n$ for which each vertex of the $n$-gon occurs in this sequence.

In the usual coordinate system $ xOy$ a line $ d$ intersect the circles $ C_1:$ $ (x\plus{}1)^2\plus{}y^2\equal{}1$ and $ C_2:$ $ (x\minus{}2)^2\plus{}y^2\equal{}4$ in the points $ A,B,C$ and $ D$ (in this order). It is known that $ A\left(\minus{}\frac32,\frac{\sqrt3}2\right)$ and $ \angle{BOC}\equal{}60^{\circ}$. All the $ Oy$ coordinates of these $ 4$ points are positive. Find the slope of $ d$.

Let $x_1, x_2, x_3, x_4$ be the distances from an arbitrary point inside the tetrahedron to the planes of its faces, and let $h_1, h_2, h_3, h_4$ be the corresponding heights of the tetrahedron. Prove that $$\sqrt{h_1+h_2+h_3+h_4} \ge \sqrt{x_1}+\sqrt{x_2}+\sqrt{x_3}+\sqrt{x_4}$$ (Dmitry Nomirovsky)

Let $ ABC$ be an equilateral triangle with side length equal to $ N \in \mathbb{N}.$ Consider the set $ S$ of all points $ M$ inside the triangle $ ABC$ satisfying \[ \overrightarrow{AM} \equal{} \frac{1}{N} \cdot \left(n \cdot \overrightarrow{AB} \plus{} m \cdot \overrightarrow{AC} \right)\] with $ m, n$ integers, $ 0 \leq n \leq N,$ $ 0 \leq m \leq N$ and $ n \plus{} m \leq N.$ Every point of S is colored in one of the three colors blue, white, red such that [b](i) [/b]no point of $ S \cap [AB]$ is coloured blue [b](ii)[/b] no point of $ S \cap [AC]$ is coloured white [b](iii)[/b] no point of $ S \cap [BC]$ is coloured red Prove that there exists an equilateral triangle the following properties: [b](1)[/b] the three vertices of the triangle are points of $ S$ and coloured blue, white and red, respectively. [b](2)[/b] the length of the sides of the triangle is equal to 1. [i]Variant:[/i] Same problem but with a regular tetrahedron and four different colors used.

Four rectangular strips each measuring $4$ by $16$ inches are laid out with two vertical strips crossing two horizontal strips forming a single polygon which looks like a tic-tack-toe pattern. What is the perimeter of this polygon? [asy] size(100); draw((1,0)--(2,0)--(2,1)--(3,1)--(3,0)--(4,0)--(4,1)--(5,1)--(5,2)--(4,2)--(4,3)--(5,3)--(5,4)--(4,4)--(4,5)--(3,5)--(3,4)--(2,4)--(2,5)--(1,5)--(1,4)--(0,4)--(0,3)--(1,3)--(1,2)--(0,2)--(0,1)--(1,1)--(1,0)); draw((2,2)--(2,3)--(3,3)--(3,2)--cycle); [/asy]

Let $ABC$ be an acute triangle with incentre $I$ and $AB \neq AC$. Let lines $BI$ and $CI$ intersect the circumcircle of $ABC$ at $P \neq B$ and $Q \neq C$, respectively. Consider points $R$ and $S$ such that $AQRB$ and $ACSP$ are parallelograms (with $AQ \parallel RB, AB \parallel QR, AC \parallel SP$, and $AP \parallel CS$). Let $T$ be the point of intersection of lines $RB$ and $SC$. Prove that points $R, S, T$, and $I$ are concyclic.

Let $ABC$ be an equilateral triangle of side length $a$, and consider $D$, $E$ and $F$ the midpoints of the sides $(AB), (BC)$, and $(CA)$, respectively. Let $H$ be the the symmetrical of $D$ with respect to the line $BC$. Color the points $A, B, C, D, E, F, H$ with one of the two colors, red and blue. [list=1] [*] How many equilateral triangles with all the vertices in the set $\{A, B, C, D, E, F, H\}$ are there? [*] Prove that if points $B$ and $E$ are painted with the same color, then for any coloring of the remaining points there is an equilateral triangle with vertices in the set $\{A, B, C, D, E, F, H\}$ and having the same color. [*] Does the conclusion of the second part remain valid if $B$ is blue and $E$ is red? [/list]

Nikolai and Peter are dividing a cake in the shape of a triangle. Firstly, Nikolai chooses one point $P$ inside the triangle and after that Peter cuts the cake by any line he chooses through $P$, then takes one of the pieces and leaves the other one for Nikolai. What’s the greatest portion of the cake Nikolai can be sure he could take, if he chooses $P$ in the best way possible?

In the triangle $ABC$, the lengths of the sides $BC, CA$ and $AB$ are $a,b$ and $c{}$ respectively. Several segments are drawn from the vertex $C{}$, which cut the triangle $ABC$ into several triangles. Find the smallest number $M{}$ for which, with each such cut, the sum of the radii of the circles inscribed in triangles does not exceed $M{}$. [i]Porposed by O. Titov[/i]