For an integer $n \geq 5,$ two players play the following game on a regular $n$-gon. Initially, three consecutive vertices are chosen, and one counter is placed on each. A move consists of one player sliding one counter along any number of edges to another vertex of the $n$-gon without jumping over another counter. A move is legal if the area of the triangle formed by the counters is strictly greater after the move than before. The players take turns to make legal moves, and if a player cannot make a legal move, that player loses. For which values of $n$ does the player making the first move have a winning strategy?

There are $12$ points that are vertices of a regular polygon with $12$ sides. Rafael must draw segments that have their two ends at two of the points drawn. He is allowed to have each point be an endpoint of more than one segment and for the segments to intersect, but he is prohibited from drawing three segments that are the three sides of a triangle in which each vertex is one of the $12$ starting points. Find the maximum number of segments Rafael can draw and justify why he cannot draw a greater number of segments.

Three disks touch pairwise from outside in the points $X,Y,Z$. Then the radiuses of the disks were expanded by $2/\sqrt3$ times, and the centres were reserved. Prove that the triangle $XYZ$ is completely covered by the expanded disks.

a) There are $2n$ rays marked in a plane, with $n$ being a natural number. Given that no two marked rays have the same direction and no two marked rays have a common initial point, prove that there exists a line that passes through none of the initial points of the marked rays and intersects with exactly $n$ marked rays. (b) Would the claim still hold if the assumption that no two marked rays have a common initial point was dropped?

Using several white edge cubes of side $ 1$, Guille builds a large cube. Then he chooses $4$ faces of the big cube and paints them red. Finally, he takes apart the large cube and observe that the cubes with at least a face painted red is $431$. Find the number of cubes that he used to assemble the large cube. Analyze all the possibilities.

Let $S$ be the set of all polygonal areas in a plane. Prove that there is a function $f : S \to (0,1)$ which satisfies $f(S_1 \cup S_2) = f(S_1)+ f(S_2)$ for any $S_1,S_2 \in S$ which have common points only on their borders

Let $T$ a set with 2007 points on the plane, without any 3 collinear points. Let $P$ any point which belongs to $T$. Prove that the number of triangles that contains the point $P$ inside and its vertices are from $T$, is even.

Let $n\ge 3$ be a positive integer. In the plane $n$ points which are not all collinear are marked. Find the least possible number of triangles whose vertices are all marked. (Recall that the vertices of a triangle are not collinear.)

Prove that there exists a set $S$ of $3^{1000}$ points in the plane such that for each point $P$ in $S$, there are at least $2000$ points in $S$ whose distance to $P$ is exactly $1$ inch.

a) Fold a $10 \times 10$ square from a $1 \times 118$ rectangular strip. b) Fold a $10 \times 10$ square from a $1 \times (100+9\sqrt3)$ rectangular strip (approximately $1\times 115.58$). The strip can be bent, but not torn.

A $23 \times 23$ square is tiled with $1 \times 1, 2 \times 2$ and $3 \times 3$ squares. What is the smallest possible number of $1 \times 1$ squares?

Consider all trapezoids in a coordinate plane with interior angles of $90^o, 90^o, 45^o$ and $135^o$ whose bases are parallel to a coordinate axis and whose vertices have integer coordinates. Define the [i]size [/i] of such a trapezoid as the total number of points with integer coordinates inside and on the boundary of the trapezoid. (a) How many pairwise non-congruent such trapezoids of size $2001$ are there? (b) Find all positive integers not greater than $50$ that do not appear as sizes of any such trapezoid.

Given $5$ points in the plane, no three of them being collinear. Show that among these $5$ points, we can always find $4$ points forming a convex quadrilateral.

Find the greatest number of depicted pieces composed of $4$ unit squares that can be placed without overlapping on an $n \times n$ grid (where n is a positive integer) in such a way that it is possible to move from some corner to the opposite corner via uncovered squares (moving between squares requires a common edge). The shapes can be rotated and reflected. [img]https://cdn.artofproblemsolving.com/attachments/b/d/f2978a24fdd737edfafa5927a8d2129eb586ee.png[/img]

Given are $50$ points in the plane, no three of them belonging to a same line. Each of these points is colored using one of four given colors. Prove that there is a color and at least $130$ scalene triangles with vertices of that color.

Let \(n>1\) be a natural number, and let \(K\) be the square of side length \(n\) subdivided into \(n^2\) unit squares. Determine for which values of \(n\) it is possible to dissect \(K\) into \(n\) connected regions of equal area using only the diagonals of those unit squares, subject to the condition that from each unit square at most one of its diagonals is used (some unit squares may have neither diagonal).

There is a regular hexagon that is cut direct to $6n^2$ equilateral triangles (Fig.). There are arranged $2n$ rooks, neither of which beats each other (the rooks hit in directions parallel to sides of the hexagon). Prove that if we consider chess coloring all $6n^2$ equilateral triangles, then the number of rooks that stand on black triangles will be equal to the number of rooks standing on white triangles. [img]https://cdn.artofproblemsolving.com/attachments/d/0/43ce6c5c966f60a8ec893d5d8cd31e33c43fc0.png[/img] [hide=original wording] Є правильний шестикутник, що розрізаний прямими на 6n^2 правильних трикутників (рис. 2). У них розставлені 2n тур, ніякі дві з яких не б'ють одна одну (тура б'є в напрямках, що паралельні до сторін шестикутника). Доведіть, що якщо розглянути шахове розфарбування всіх 6n^2 правильних трикутників, то тоді кількість тур, що стоять на чорних трикутниках, буде рівна кількості тур, що стоять на білих трикутниках. [/hide]

A cube is divided into $27$ equal smaller cubes. A plane intersects the cube. Find the maximum possible number of smaller cubes the plane can intersect.

The faces of a convex polyhedron are similar triangles. Prove that this polyhedron has two pairs of congruent faces.

Find the greatest $n$ such that $(z+1)^n = z^n + 1$ has all its non-zero roots in the unitary circumference, e.g. $(\alpha+1)^n = \alpha^n + 1, \alpha \neq 0$ implies $|\alpha| = 1.$

On the plane $n+1$ points are marked, no three of which lie on one straight line. For what natural $k$ can they be connected by segments so that for any $n$ marked points there are exactly $k$ segments with ends at these points?

Consider a set of $2016$ distinct points in the plane, no four of which are collinear. Prove that there is a subset of $63$ points among them such that no three of these $63$ points are collinear.

Let $m,n \ge 2$ be integers. The sides $A_{00}A_{0m}$ and $A_{nm}A_{n0}$ of a convex quadrilateral $A_{00}A_{0m}A_{nm}A_{n0}$ are divided into $m$ equal segments by points $A_{0j}$ and $A_{nj}$ respectively ($j = 1,...,m-1$). The other two sides are divided into $n$ equal segments by points $A_{i0}$ and $A_{im}$ ($i = 1,...,n -1$). Denote by $A_{ij}$ the intersection of lines $A_{0j}A{nj}$ and $A_{i0}A_{im}$, by $S_{ij}$ the area of quadrilateral $A_{ij}A_{i, j+1}A_{i+1, j+1}A_{i+1, j}$ and by $S$ the area of the big quadrilateral. Show that $S_{ij} +S_{n-1-i,m-1-j} = \frac{2S}{mn}$

There are $100$ red, $100$ yellow and $100$ green sticks. One can construct a triangle using any three sticks all of different colours (one red, one yellow and one green). Prove that there is a colour such that one can construct a triangle using any three sticks of this colour.

Let $ABC$ be an equilateral triangle of side $1$. There are three grasshoppers sitting in $A$, $B$, $C$. At any point of time for any two grasshoppers separated by a distance $d$ one of them can jump over other one so that distance between them becomes $2kd$, $k,d$ are nonfixed positive integers. Let $M$, $N$ be points on rays $AB$, $AC$ such that $AM=AN=l$, $l$ is fixed positive integer. In a finite number of jumps all of grasshoppers end up sitting inside the triangle $AMN$. Find, in terms of $l$, the number of final positions of the grasshoppers. (Grasshoppers can leave the triangle $AMN$ during their jumps.)