Which convex domains (figures) on a plane can contain an entire straight line? It is assumed that the figure is flat and does not degenerate into a straight line and is closed, that is, it contains all its boundary points.

Ten points are marked in the plane so that no three of them lie on the same straight line. All points are connected with segments.Each of these segments is painted one of the $k$ colors. For what positive integer $k$ ($1 \le k \le 5$) is it possible to paint the segments so that for any $k$ of the given $10$ points there are $k$ segments with the ends at these $k$ points, all of these segments being painted $k$ different colors ? (E. Barabanov)

For what positive integers $n$ is it possible to tile an equilateral triangle of side $n$ with trapezoids each of which has sides $1, 1, 1, 2$? (NB Vassiliev)

A polyhedron has an even number of edges. Show that we can place an arrow on each edge so that each vertex has an even number of arrows pointing towards it (on adjacent edges).

Among the $5$-sided polygons, as many vertices as possible collinear , that is, belonging to a single line, is three, as shown below. What is the largest number of collinear vertices a $12$-sided polygon can have? [img]https://cdn.artofproblemsolving.com/attachments/1/1/53d419efa4fc4110730a857ae6988fc923eb13.png[/img] Attention: In addition to drawing a $12$-sided polygon with the maximum number of vertices collinear , remember to show that there is no other $12$-sided polygon with more vertices collinear than this one.

With $76$ tiles, of which some are white, other blue and the remaining red, they form a rectangle of $4 \times 19$. Show that there is a rectangle, inside the largest, that has its vertices of the same color.

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?

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.

On the numerical line, arrange a system of closed segments of length $1$ without common points (endpoints included) so that any infinite arithmetic progression with any non zero difference and any first term has a common point with a segment of the system.

Nine lattice points (i.e. with integer coordinates) $P_1,P_2,...,P_9$ are given in space. Show that the midpoint of at least one of the segments $P_iP_j$ , where $1 \le i < j \le 9$, is a lattice point as well.

If $C$ is a set of $n$ points in the plane that has the following property: For each point $P$ of $C$, there are four points of $C$, each one distinct from $P$ , which are the vertices of a square. Find the smallest possible value of $n$.

For any set of points $A_1, A_2,...,A_n$ on the plane, one defines $r( A_1, A_2,...,A_n)$ as the radius of the smallest circle that contains all of these points. Prove that if $n \ge 3$, there are indices $i,j,k$ such that $r( A_1, A_2,...,A_n)=r( A_i, A_j,A_k)$

For any convex polygon $ W $ with area 1, let us denote by $ f(W) $ the area of the convex polygon whose vertices are the centers of all sides of the polygon $ W $. For each natural number $ n \geq 3 $, determine the lower limit and the upper limit of the set of numbers $ f(W) $ when $ W $ runs through the set of all $ n $ convex angles with area 1.

Let $n$ be a natural number. Suppose $A$ and $B$ are two sets, each containing $n$ points in the plane, such that no three points of a set are collinear. Let $T(A)$ be the number of broken lines, each containing $n-1$ segments, and such that it doesn't intersect itself and its vertices are points of $A$. Define $T(B)$ similarly. If the points of $B$ are vertices of a convex $n$-gon (are in [i]convex position[/i]), but the points of $A$ are not, prove that $T(B)<T(A)$. [i]Proposed by Ali Khezeli[/i]

On each side of a triangle, $5$ points are chosen (other than the vertices of the triangle) and these $15$ points are colored red. How many ways are there to choose four red points such that they form the vertices of a quadrilateral?

$101$ blue and $101$ red points are selected on the plane, and no three lie on one straight line. The sum of the pairwise distances between the red points is $1$ (that is, the sum of the lengths of the segments with ends at red points), the sum of the pairwise distances between the blue ones is also $1$, and the sum of the lengths of the segments with the ends of different colors is $400$. Prove that you can draw a straight line separating everything red dots from all blue ones.

Dorothy organized a party for the birthday of Duck Mom and she also prepared a cylindershaped cake. Since she was originally expecting to have $15$ guests, she divided the top of the cake into this many equal circular sectors, marking where the cuts need to be made. Just for fun Dorothy’s brother Donald split the top of the cake into $10$ equal circular sectors in such a way that some of the radii that he marked coincided with Dorothy’s original markings. Just before the arrival of the guests Douglas cut the cake according to all markings, and then he placed the cake into the fridge. This way they forgot about the cake and only got to eating it when only $6$ of them remained. Is it possible for them to divide the cake into $6$ equal parts without making any further cuts?

Consider a convex $15$- gon with perimeter $21$. Show that there one can select three distinct pairs of vertices that form a triangle with area less than $1$. [hide=original wording of second sentence]Zeige, dass man davon drei paarweise verschiedene Eckpunkte auswählen kann, die ein Dreieck mit Fläche kleiner als 1 bilden.[/hide]

Let $A$ and $B$ be two points inside a circle $C$. Show that there exists a circle that contains $A$ and $B$ and lies completely inside $C$.

How many different ways (up to rotation) are there of labeling the faces of a cube with the numbers $1, 2,..., 6$?

A [i]form [/i] is the union of squared rectangles whose bases are consecutive unitary segments in a horizontal line that leaves all the rectangles on the same side, and whose heights $m_1, ... , m_n$ satisying $m_1\ge ... \ge m_n$. An [i]angle [/i] in a [i]form [/i] consists of a box $v$ and of all the boxes to the right of $v$ and all the boxes above $v$. The size of a [i]form [/i] of an [i]angle [/i] is the number of boxes it contains. Find the maximum number of [i]angles [/i] of size $11$ in a form of size $400$. [url=http://www.oma.org.ar/enunciados/omr20.htm]source[/url]

Define the distance between two triangles to be the closest distance between two vertices, one from each triangle. Is it possible to draw five triangles in the plane such that for any two of them, their distance equals the sum of their circumradii?

Let $ D$ be a convex subset of the $ n$-dimensional space, and suppose that $ D'$ is obtained from $ D$ by applying a positive central dilatation and then a translation. Suppose also that the sum of the volumes of $ D$ and $ D'$ is $ 1$, and $ D \cap D'\not\equal{} \emptyset .$ Determine the supremum of the volume of the convex hull of $ D \cup D'$ taken for all such pairs of sets $ D,D'$. [i]L. Fejes-Toth, E. Makai[/i]

A crate with a base of $4 \times 2$ and a height of $2$ is open at the top. Tomas wants to completely fill the crate with some of his cubes. It has $16$ equal cubes of volume $1$ and two equal cubes of volume $8$. A cube of volume $1$ can only be placed on the top layer if the cube on the bottom layer has already been placed. In how many ways can Tom'as fill the box with cubes, placing them one by one?

Let $S$ be a set of 1980 points in the plane such that the distance between every pair of them is at least 1. Prove that $S$ has a subset of 220 points such that the distance between every pair of them is at least $\sqrt{3}.$