We consider a number of points in a plane. Each of these points is connected to at least one of the other points by a line segment, in such a way that a figure arises that does not break up into different parts (that is, from any point along drawn line segments we can reach any other point).. We assign a point the ”order” $n$, when in this point $n$ line segments meet. We characterize the obtained figure by writing down the order of each of its points one after the other. For example, a hexagon is characterized by the combination $\{2,2,2,2,2,2\}$ and a star with six rays by $\{6,1,1,1,1,1,1\}$. (a) Sketch a figure' belonging to the combination $\{4,3,3,3,3\}$. (b) Give the combinations of all possible figures, of which the sum of the order numbers is equal to $6$. (c) Prove that every such combination contains an even number of odd numbers.

On a plane, several points are chosen so that a disc of radius $1$ can cover every $3$ of them. Prove that a disc of radius $1$ can cover all the points.

A square is divided into $25$ small squares. We draw diagonals of some of the small squares so that no two diagonals share a common point (not even a common endpoint). What is the largest possible number of diagonals that we can draw? (I Rubanov)

Find all pairs $(m, n)$ of positive integers such that the $m \times n$ grid contains exactly $225$ rectangles whose side lengths are odd and whose edges lie on the lines of the grid.

Given positive integer $ n \ge 5 $ and a convex polygon $P$, namely $ A_1A_2...A_n $. No diagonals of $P$ are concurrent. Proof that it is possible to choose a point inside every quadrilateral $ A_iA_jA_kA_l (1\le i<j<k<l\le n) $ not on diagonals of $P$, such that the $ \tbinom{n}{4} $ points chosen are distinct, and any segment connecting these points intersect with some diagonal of P.

$3n-1$ points are given in the plane, no three are collinear. Prove that one can select $2n$ of them whose convex hull is not a triangle.

Is it possible to fill a rectangular table with black and white squares (only) so, that the number of black squares will equal to the number of white squares, and each row and each column will have more than $75\%$ squares of the same colour?

Let us define [i]cutting[/i] a convex polygon with $n$ sides by choosing a pair of consecutive sides $AB$ and $BC$ and substituting them by three segments $AM, MN$, and $NC$, where $M$ is the midpoint of $AB$ and $N$ is the midpoint of $BC$. In other words, the triangle $MBN$ is removed and a convex polygon with $n+1$ sides is obtained. Let $P_6$ be a regular hexagon with area $1$. $P_6$ is [i]cut[/i] and the polygon $P_7$ is obtained. Then $P_7$ is cut in one of seven ways and polygon $P_8$ is obtained, and so on. Prove that, regardless of how the cuts are made, the area of $P_n$ is always greater than $2/3$.

Do there exist 2021 points with integer coordinates on the plane such that the pairwise distances between them are pairwise distinct consecutive integers?

$60$ points lie on the plane, such that no three points are collinear. Prove that one can divide the points into $20$ groups, with $3$ points in each group, such that the triangles ( $20$ in total) consist of three points in a group have a non-empty intersection.

Let $n>1$ be an integer. Suppose we are given $2n$ points in the plane such that no three of them are collinear. The points are to be labelled $A_1, A_2, \dots , A_{2n}$ in some order. We then consider the $2n$ angles $\angle A_1A_2A_3, \angle A_2A_3A_4, \dots , \angle A_{2n-2}A_{2n-1}A_{2n}, \angle A_{2n-1}A_{2n}A_1, \angle A_{2n}A_1A_2$. We measure each angle in the way that gives the smallest positive value (i.e. between $0^{\circ}$ and $180^{\circ}$). Prove that there exists an ordering of the given points such that the resulting $2n$ angles can be separated into two groups with the sum of one group of angles equal to the sum of the other group.

Vera has several identical matches, from which she makes a triangle. Vera wants any two sides of this triangle to differ in length by at least $10$ matches, but it turned out that it is impossible to add such a triangle from the available matches (it is impossible to leave extra matches). What is the maximum number of matches Vera can have?

Consider $4n$ points in the plane such that no three of them are collinear ($n\geq 1$). Show that the set of centroids of all the triangles formed by any three of these points contains at least $4n$ elements. [i]Radu Bumbăcea[/i]

All vertices of a hexagon, whose sides may intersect at points other than the vertices, lie on a circle. (a) Draw a hexagon such that it has the largest possible number of points of self-intersection. (b) Prove that this number is indeed maximum. (NB Vassiliev)

Let $\mathcal{S}$ be the set of all points in the plane. Find all functions $f : \mathcal{S} \rightarrow \mathbb{R}$ such that for all nondegenerate triangles $ABC$ with orthocenter $H$, if $f(A) \leq f(B) \leq f(C)$, then $$f(A) + f(C) = f(B) + f(H).$$

For each finite set $ U$ of nonzero vectors in the plane we define $ l(U)$ to be the length of the vector that is the sum of all vectors in $ U.$ Given a finite set $ V$ of nonzero vectors in the plane, a subset $ B$ of $ V$ is said to be maximal if $ l(B)$ is greater than or equal to $ l(A)$ for each nonempty subset $ A$ of $ V.$ (a) Construct sets of 4 and 5 vectors that have 8 and 10 maximal subsets respectively. (b) Show that, for any set $ V$ consisting of $ n \geq 1$ vectors the number of maximal subsets is less than or equal to $ 2n.$

Given any six points in the plane, no three collinear, show that we can always find three which form an obtuse-angled triangle with one angle at least $120^o$.

We call a set of cells on a checkered plane [i]rook-connected[/i] if from any of its cells one can get to any other by moving along the cells of this set by moving the rook (the rook is allowed to fly through fields that do not belong to our set). Prove that a [i]rook-connected[/i] set of $100$ cells can be divided into pairs of cells, lying in one row or in one column.

For every $n \in N$, is it possible to make a figure consisting of $n+1$ points, where $n$ points lie on one line and one point is not on that line, so that each pair of those points is an integer distance from each other?

A semicircle of radius $r$ is divided into $n + 1$ equal parts and any point $k$ of the division with the ends of the semicircle forms a triangle $A_k$. Calculate the limit, as $n$ tends to infinity, of the arithmetic mean of the areas of the triangles.

An $m \times n$ rectangle is divided into mn unit squares by lines parallel to its sides. A gnomon is the figure of three unit squares formed by deleting one unit square from a $2 \times 2$ square. For what $m, n$ can we divide the rectangle into gnomons so that no two gnomons form a rectangle and no vertex is in four gnomons?

Some of the vertices of a convex $n$-gon are connected by segments, such that any two of them have no common interior point. Prove that, for any $n$ points in general position, there exists a one-to-one correspondence between the points and the vertices of the $n$ gon, such that any two segments between the points, corresponding to the respective segments from the $n$ gon, have no common interior point.

In the center of a square is a rabbit and at each vertex of this even square, a wolf. The wolves only move along the sides of the square and the rabbit moves freely in the plane. Knowing that the rabbit move at a speed of $10$ km / h and that the wolves move to a maximum speed of $14$ km / h, determine if there is a strategy for the rabbit to leave the square without being caught by the wolves.

Let $n>d$ be positive integers. Choose $n$ independent, uniformly distributed random points $x_1,\dots,x_n$ in the unit ball $B \subset \mathbb{R}^d$ centered at the origin. For a point $p \in B$ denote by $f(p)$ the probability that the convex hull of $x_1,\dots,x_n$ contains $p$. Prove that if $p,q \in B$ and the distance of $p$ from the origin is smaller than the distance of $q$ from the origin, then $f(p) \ge f(q)$.

No matter how two copies of a convex polygon are placed inside a square, they always have a common point. Prove that no matter how three copies of the same polygon are placed inside this square, they also have a common point.