There is a token in one of the nodes of a hexagon with side $n$, divided into regular triangles (see figure). Two players take turns moving it to one of the neighboring nodes, and it is forbidden to go to a node that the token has already visited. The one who loses who can't make a move. Who wins with the right game? [img]https://cdn.artofproblemsolving.com/attachments/2/f/18314fe7f9f4cd8e783037a8e5642e17f4e1be.png[/img]

A regular tetrahedron with unit edge length is given. Prove that: (a) There exist four points on the surface $S$ of the tetrahedron, such that the distance from any point of the surface to one of these four points does not exceed $1/2$; (b) There do not exist three points with this property. The distance between two points on surface $S$ is defined as the length of the shortest polygonal line going over $S$ and connecting the two points.

(a) Let be given $2n$ distinct points on a circumference, $n$ of which are red and $n$ are blue. Prove that one can join these points pairwise by $n$ segments so that no two segments intersect and the endpoints of each segments have different colors. (b) Show that the statement from (a) remains valid if the points are in an arbitrary position in the plane so that no three of them are collinear.

A circular target with a radius of $12$ cm was hit by $19$ shots. Prove that the distance between two hits is less than $7$ cm.

* Let $A, B, C$ be three nodes of a graph paper. Prove that if $\vartriangle ABC$ is an acute one, then there is at least one more node either inside $\vartriangle ABC$ or on one of its sides.

On each side of an equilateral triangle of side $n \ge 1$ consider $n - 1$ points that divide the sides into $n$ equal segments. Through these points draw parallel lines to the sides of the triangles, obtaining a net of equilateral triangles of side length $1$. On each of the vertices of the small triangles put a coin head up. A move consists in flipping over three mutually adjacent coins. Find all values of $n$ for which it is possible to turn all coins tail up after a finite number of moves. Colombia 1997

Five distinct points and five distinct lines are given in the plane. Prove that one can select two of the points and two of the lines so that none of the selected lines contains any of the selected points.

A $100\times \sqrt{3}$ rectangular table is given. What is the minimum number of disk-shaped napkins of radius $1$ required to cover the table completely? [i]Remark:[/i] The napkins are allowed to overlap and protrude the table's edges.

There are $N{}$ points marked on the plane. Any three of them form a triangle, the values of the angles of which in are expressed in natural numbers (in degrees). What is the maximum $N{}$ for which this is possible? [i]Proposed by E. Bakaev[/i]

Prove that any convex polyhedron with $10n$ faces, has at least $n$ faces with the same number of sides. (A Kanel)

A convex polyhedron has $2n$ faces ($n\ge 3$), and all faces are triangles. What is the largest number of vertices at which converges exactly $3$ edges at a such a polyhedron ?

We have $10,000$ identical equilateral triangles. Consider the largest regular hexagon that can be formed with these triangles without overlapping. How many triangles will not be used?

Determine all integers $n \geq 3$ for which there exists a conguration of $n$ points in the plane, no three collinear, that can be labelled $1$ through $n$ in two different ways, so that the following condition be satisfied: For every triple $(i,j,k), 1 \leq i < j < k \leq n$, the triangle $ijk$ in one labelling has the same orientation as the triangle labelled $ijk$ in the other, except for $(i,j,k) = (1,2,3)$.

What is the smallest number of $3$-cell corners needed to be painted in a $6\times 6$ square so that it was impossible to paint more than one corner of it? (The painted corners should not overlap.)

An equilateral triangle with side 101 is placed on a plane so that one of its sides is horizontal and the triangle is above it. It is divided into smaller equilateral triangles with side 1 by segments parallel to its sides. All sides of these smaller triangles are colored red (including the entire border of the large triangle). An equilateral triangle on a plane is called a "mirror" triangle if its sides are parallel to the sides of the original triangle, but it lies below its horizontal side. What is the smallest number of contours of mirror triangles needed to cover all the red segments? (Mirror triangles may overlap and extend beyond the original triangle.) [i]Proposed by Dmitry Shiryayev[/i]

Show that amongst any $ 8$ points in the interior of a $7 \times 12$ rectangle, there exists a pair whose distance is less than $5$. Note: The interior of a rectangle excludes points lying on the sides of the rectangle.

Two players $A$ and $B$ play the following game: $A$ chooses a point, with integer coordinates, on the plane and colors it green, then $B$ chooses $10$ points of integer coordinates, not yet colored, and colors them yellow. The game always continues with the same rules; $A$ and $B$ choose one and ten uncolored points and color them green and yellow, respectively. a. The objective of $A$ is to achieve $111^2$ green points that are the intersections of $111$ horizontal lines and $111$ vertical lines (parallel to the coordinate axes). $B$'s goal is to stop him. Determine which of the two players has a strategy that ensures you achieve your goal. b. The objective of $A$ is to achieve $4$ green points that are the vertices of a square with sides parallel to the coordinate axes. $B$'s goal is to stop him. Determine which of the two players has a strategy that will ensure that they achieve their goal.

Pinocchio claims that he can divide an isoceles triangle into three triangles, any two of which can be put together to form a new isosceles triangle. Is Pinocchio lying? (A Shapovalov)

Given $n>3$ points in the plane such that no three of the points are collinear. Does there exist a circle passing through (at least) $3$ of the given points and not containing any other of the $n$ points in its interior ?

Let $ABCD$ be a square with side $20$ and $T_1, T_2, ..., T_{2000}$ are points in $ABCD$ such that no $3$ points in the set $S = \{A, B, C, D, T_1, T_2, ..., T_{2000}\}$ are collinear. Prove that there exists a triangle with vertices in $S$, such that the area is less than $1/10$.

There are $n$ circles drawn on a piece of paper in such a way that any two circles intersect in two points, and no three circles pass through the same point. Turbo the snail slides along the circles in the following fashion. Initially he moves on one of the circles in clockwise direction. Turbo always keeps sliding along the current circle until he reaches an intersection with another circle. Then he continues his journey on this new circle and also changes the direction of moving, i.e. from clockwise to anticlockwise or $\textit{vice versa}$. Suppose that Turbo’s path entirely covers all circles. Prove that $n$ must be odd. [i]Proposed by Tejaswi Navilarekallu, India[/i]

Every side and diagonal of a regular $12$-gon is colored in one of $12$ given colors. Can this be done in such a way that, for every three colors, there exist three vertices which are connected to each other by segments of these three colors?

Let $\overline{a_{n}a_{n-1}\ldots a_{1}a_{0}}$ be the decimal representation of a prime positive integer such that $n>1$ and $a_{n}>1$. Prove that the polynomial $P(x)=a_{n}x^{n}+\ldots +a_{1}x+a_{0}$ cannot be written as a product of two non-constant integer polynomials.

Prove that if every line connecting any two points of some finite set of points of the plane contains at least one more point of this set, then all points of the set lie on one straight line.

We color all points of a plane using $3$ colors. Prove that there are at least two points of the plane having same colours and with distance among them $1$.