The vertices of a regular $2n$-gon (with $n > 2$ an integer) are labelled with the numbers $1,2,...,2n$ in some order. Assume that the sum of the labels at any two adjacent vertices equals the sum of the labels at the two diametrically opposite vertices. Prove that this is possible if and only if $n$ is odd.

The points of the plane are colored in black and white so that whenever three vertices of a parallelogram are the same color, the fourth vertex is that color, too. Prove that all the points of the plane are the same color.

a) Are there rectangles $1\times \dfrac12$ rectangles lying strictly inside the interior of a unit square? b) Find the minimum number of equilateral triangles of unit side which can cover completely a unit square. [i]Laurențiu Panaitopol[/i]

The map of a town shows a plane divided into equal equilateral triangles. The sides of these triangles are streets and their vertices are intersections; $6$ streets meet at each junction. Two cars start simultaneously in the same direction and at the same speed from points $A$ and $B$ situated on the same street (the same side of a triangle). After any intersection an admissible route for each car is either to proceed in its initial direction or turn through $120^o$ to the right or to the left. Can these cars meet? (Either prove that these cars won’t meet or describe a route by which they will meet.) [img]https://cdn.artofproblemsolving.com/attachments/2/d/2c934bcd0c7fc3d9dca9cee0b6f015076abbdb.png[/img]

An equilateral triangle side $10$ is divided into $100$ equilateral triangles of side $1$ by lines parallel to its sides. There are m equilateral tiles of $4$ unit triangles and $25 - m$ straight tiles of $4$ unit triangles (as shown below). For which values of $m$ can they be used to tile the original triangle. [The straight tiles may be turned over.]

On the plane we consider $70$ points $A_1,A_2,...,A_{70}$ with integer coodinates. Suppose each pooints has weight $1$ and the centers of gravity of the triangles $ A_1A_2A_3$, $A_2A_3A_4$, $..$., $A_{68}A_{69}A_{70}$, $A_{69}A_{70}A_{1}$, $A_{70}A_{1}A_{2}$ have integer coodinates. Prove that the centers of gravity of any triple $A_i,A_j,...,A_{k}$ has integer coodinates.

Let $P$ be a $2019-$gon, such that no three of its diagonals concur at an internal point. We will call each internal intersection point of diagonals of $P$ a knot. What is the greatest number of knots one can choose, such that there doesn't exist a cycle of chosen knots? ( Every two adjacent knots in a cycle must be on the same diagonal and on every diagonal there are at most two knots from a cycle.)

The workers laid a floor of size $n \times n$ with tiles of two types: $2 \times 2$ and $3 \times 1$. It turned out that they were able to completely lay the floor in such a way that the same number of tiles of each type was used. Under what conditions could this happen? (You can’t cut tiles and also put them on top of each other.)

Consider a square of sidelength $ n$ and $ (n\plus{}1)^2$ interior points. Prove that we can choose $ 3$ of these points so that they determine a triangle (eventually degenerated) of area at most $ \frac12$.

Show that no matter how $15$ points are plotted within a circle of radius $2$ (circle border included), there will be a circle with radius $1$ (circle border including) which contains at least three of the $15$ points.

Let $\Omega$ be a circle disk with radius $1$. Determine the minimum $r$ that has the following property: You can select three points on $\Omega$ so that each circle disk located in $\Omega$ and has a radius greater than $r$ contains at least one of the three points.

In the plane you have $2018$ points between which there are not three on the same line. These points are colored with $30$ colors so that no two colors have the same number of points. All triangles are formed with their three vertices of different colors. Determine the number of points for each of the $30$ colors so that the total number of triangles with the three vertices of different colors is as large as possible.

Find all integers $n \ge 3$ with the following property: it is possible to assign pairwise different positive integers to the vertices of an $n$-gonal prism in such a way that vertices with labels $a$ and $b$ are connected by an edge if and only if $a | b$ or $b | a$. Poland

A $7\times 7$ square is cut into pieces following types: [img]https://cdn.artofproblemsolving.com/attachments/e/d/458b252c719946062b655340cbe8415d1bdaf9.png[/img] Show that exactly one of the pieces is of type (b). [img]https://cdn.artofproblemsolving.com/attachments/4/9/f3dd0e13fed9838969335c82f5fe866edc83e8.png[/img]

Determine the values of $n \in N$ such that a square of side $n$ can be split into a square of side $1$ and five rectangles whose side measures are $10$ distinct natural numbers and all greater than $1$.

Given $n$ lines on the plane, they divide the plane onto several bounded or bounded polygonal regions. Define the rank of a region as the number of vertices on its boundary (a vertex is a point which belongs to at least two lines). Prove that the sum of squares of ranks of all regions does not exceed $10n^2$. (D. Fomin)

The pieces in a game are squares of side $1$ with their sides colored with $4$ colors: blue, red, yellow and green, so that each piece has one side of each color. There are pieces in every possible color arrangement, and the game has a million pieces of each kind. With the pieces, rectangular puzzles are assembled, without gaps or overlaps, so that two pieces that share a side have that side of the same color. Determine if with this procedure you can make a rectangle of $99\times 2007$ with one side of each color. And $100\times 2008$? And $99\times 2008$?

Consider the $8\times 8\times 8$ Rubik’s cube below. Each face is painted with a different color, and it is possible to turn any layer, as you can with smaller Rubik’s cubes. Let $X$ denote the move that turns the shaded layer shown (indicated by arrows going from the top to the right of the cube) clockwise by $90$ degrees, about the axis labeled $X$. When move $X$ is performed, the only layer that moves is the shaded layer. Likewise, define move $Y$ to be a clockwise $90$-degree turn about the axis labeled Y, of just the shaded layer shown (indicated by the arrows going from the front to the top, where the front is the side pierced by the $X$ rotation axis). Let $M$ denote the move “perform $X$, then perform $Y$.” [img]https://cdn.artofproblemsolving.com/attachments/e/f/951ea75a3dbbf0ca23c45cd8da372595c2de48.png[/img] Imagine that the cube starts out in “solved” form (so each face has just one color), and we start doing move $M$ repeatedly. What is the least number of repeats of $M$ in order for the cube to be restored to its original colors?

Located on the plane $\left[ \frac43 n \right]$ rectangles with sides parallel to the coordinate axes. It is known that any rectangle intersects at least n rectangles. Prove that exists a rectangle that intersects all rectangles.

The sides of a convex regular polygon of $L + M + N$ sides are to be given draw in three colors: $L$ of them with a red stroke, $M$ with a yellow stroke, and $N$ with a blue. Express, through inequalities, the necessary and sufficient conditions so that there is a solution (several, in general) to the problem of doing it without leaving two adjacent sides drawn with the same color.

Given $3n$ points in the plane, no three collinear, is it always possible to form $n$ triangles (with vertices at the points), so that no point in the plane lies in more than one triangle?

A point is chosen inside a regular $k$-gon in such a way that its orthogonal projections on to the sides all meet the respective sides at interior points. These points divide the sides into $2k$ segments. Let these segments be enumerated consecutively by the numbers $1,2, 3, ... ,2k$. Prove that the sum of the lengths of the segments having even numbers equals the sum of the segments having odd numbers. (A Andjans, Riga)

Given $n$ points in the plane, show that we can always find three which give an angle $\le \pi / n$.

Three lines are drawn in a plane. Which of the following could NOT be the total number of points of intersections? (A) $0$ (B) $1$ (C) $2$ (D) $3$ (E) They all could.

For which values of n does there exist a polyhedron having $n$ edges?