Given a regular $72$-gon. Lenya and Kostya play the game "Make an equilateral triangle." They take turns marking with a pencil on one still unmarked angle of the $72$-gon: Lenya uses red. Kostya uses blue. Lenya starts the game, and the one who marks first wins if its color is three vertices that are the vertices of some equilateral triangle, if all the vertices are marked and no such a triangle exists, the game ends in a draw. Prove that Kostya can play like this so as not to lose.

Let $n$ be a natural number. Determine the minimal number of equilateral triangles of side $1$ to cover the surface of an equilateral triangle of side $n +\frac{1}{2n}$.

An equilateral triangle of side $x$ has its vertices on the sides of a square side $1$. What are the possible values of $x$?

On sides $AB$ and $BC$ of an equilateral triangle $ABC$ are taken points $D$ and $K$, and on the side $AC$ , points $E$ and $M$ so that $DA + AE = KC +CM = AB$. Prove that the angle between lines $DM$ and $KE$ is equal to $60^o$.

An arbitrary point $M$ is taken inside a regular triangle $ABC$. Prove, that on sides $AB$, $BC$ and $CA$ one can choose points $C_1$, $A_1$ and $B_1$, respectively, so that $B_1C_1 = AM$, $C_1A_1 = BM$, $A_1B_1 = CM$. Find $BA$ if $AB_1= a$, $AC_1 = b$, $a>b$.

A frog trainer places one frog at each vertex of an equilateral triangle $ABC$ of unit sidelength. The trainer can make one frog jump over another along the line joining the two, so that the total length of the jump is an even multiple of the distance between the two frogs just before the jump. Let $M$ and $N$ be two points on the rays $AB$ and $AC$, respectively, emanating from $A$, such that $AM = AN = \ell$, where $\ell$ is a positive integer. After a finite number of jumps, the three frogs all lie in the triangle $AMN$ (inside or on the boundary), and no more jumps are performed. Determine the number of final positions the three frogs may reach in the triangle $AMN$. (During the process, the frogs may leave the triangle $AMN$, only their nal positions are to be in that triangle.)

Within an equilateral triangle $ABC$, take any point $P$. Let $L, M, N$ be the projections of $P$ on sides $AB, BC, CA$ respectively. Prove that $\frac{AP}{NL}=\frac{BP}{LM}=\frac{CP}{MN}$.

(a) Does there exist an innite triangular beam such that two of its cross-sections are similar but not congruent triangles? (b) Does there exist an innite triangular beam such that two of its cross-sections are equilateral triangles of sides $1$ and $2$ respectively?

Let $ABC$ be an equilateral triangle. Let $P$ and $S$ be points on $AB$ and $AC$, respectively, and let $Q$ and $R$ be points on $BC$ such that $PQRS$ is a rectangle. If $PQ = \sqrt3 PS$ and the area of $PQRS$ is $28\sqrt3$, what is the length of $PC$?

On the sides $BC, AC$ and $AB$ of the equilateral triangle $ABC$ mark the points $D, E$ and $F$ so that $\angle AEF = \angle FDB$ and $\angle AFE = \angle EDC$. Prove that $DA$ is the bisector of the angle $EDF$.

Given a circle, point $C$ on it and point $A$ outside the circle. The equilateral triangle $ACP$ is constructed on the segment $AC$. Point $C$ moves along the circle. What trajectory will the point $P$ describe?

An equilateral triangle of side$ 1$ is rotated around its center, yielding another equilareral triangle. Find the area of the intersection of these two triangles.

Let us call "[i]big[/i]" a triangle with all sides longer than $1$. Given a equilateral triangle with all the sides equal to $5$. Prove that: a) You can cut $100$ [i]big [/i] triangles out of given one. b) You can divide the given triangle onto $100$ [i]big [/i] nonintersecting ones fully covering the initial one. c) The same as b), but the triangles either do not have common points, or have one common side, or one common vertex. d) The same as c), but the initial triangle has the side $3$.

Triangle $ABC$ is equilateral. The point $D$ lies on the extension of $AB$ beyond $B$, the point $E$ lies on the extension of $CB$ beyond $B$, and $|CD| = |DE|$. Prove that $|AD| = |BE|$. [img]https://1.bp.blogspot.com/-QnAXFw3ijn0/XzR0YjqBQ3I/AAAAAAAAMU0/0TvhMQtBNjolYHtgXsQo2OPGJzEYSfCwACLcBGAsYHQ/s0/2015%2BMohr%2Bp3.png[/img]

Rosemonde is stacking spheres to make pyramids. She constructs two types of pyramids $S_n$ and $T_n$. The pyramid $S_n$ has $n$ layers, where the top layer is a single sphere and the $i^{th}$ layer is an $i\times $i square grid of spheres for each $2 \le i \le n$. Similarly, the pyramid $T_n$ has $n$ layers where the top layer is a single sphere and the $i^{th}$ layer is $\frac{i(i+1)}{2}$ spheres arranged into an equilateral triangle for each $2 \le i \le n$.

The shape of a military base is an equilateral triangle of side $10$ kilometers. Security constraints make cellular phone com­munication possible only within $2.5$ kilometers. Each of $17$ soldiers patrols the base randomly and tries to contact all others. Prove that at each moment at least two soldiers can communicate.