Two straight lines divide a square of side length $1$ into four regions. Show that at least one of the regions has a perimeter greater than or equal to $2$. [i]Proposed by Dylan Toh[/i]

For which positive integers $n \ge 3$ is it possible to mark $n$ points of a plane in such a way that, starting from one marked point and moving on each step to the marked point which is the second closest to the current point, one can walk through all the marked points and return to the initial one? For each point, the second closest marked point must be uniquely determined.

We are given a regular decagon with all diagonals drawn. The number "$+ 1$ " is attached to each vertex and to each point where diagonals intersect (we consider only internal points of intersection). We can decide at any time to simultaneously change the sign of all such numbers along a given side or a given diagonal . Is it possible after a certain number of such operations to have changed all the signs to negative?

Alma places spies on some of the squares on a $2020\times 2020$ game board. Now Bertha secretly chooses a quadradic area consisting of $1020 \times 1020$ squares and tells Alma which spies are standing on a square in the secret quadradic area. At least how many spies must Alma have placed in order for her to determine with certainty which area Bertha has chosen?

Some natural numbers are marked. It is known that on every a segment of the number line of length $1999$ has a marked number. Prove that there is a pair of marked numbers, one of which is divisible by the other.

Inside a square with sides of length $1$ unit several non-overlapping smaller squares with sides parallel to the sides of the large square are placed (the small squares may differ in size). Draw a diagonal of the large square and consider all of the small squares intersecting it. Can the sum of their perimeters be greater than $1993$? (AN Vblmogorov)

Can a paper circle be cut into pieces and then rearranged into a square of the same area, if only a finite number of cuts is allowed and they must be along segments of straight lines or circular arcs? (A Belov)

A cube with the edge of length $n$ is divided onto $n^3$ unit ones. Let us choose some of them and draw three lines parallel to the edges through their centres. What is the least possible number of the chosen small cubes necessary to make those lines cross all the smaller cubes? a) Find the answer for the small $n$ ($n = 2,3,4$). b) Try to find the answer for $n = 10$. c) If You can not solve the general problem, try to estimate that value from the upper and lower side. d) Note, that You can reformulate the problem in such a way: Consider all the triples $(x_1,x_2,x_3)$, where $x_i$ can be one of the integers $1,2,...,n$. What is the minimal number of the triples necessary to provide the property: [i]for each of the triples there exist the chosen one, that differs only in one coordinate. [/i] Try to find the answer for the situation with more than three coordinates, for example, with four.

Let two ants stand on the perimeter of a regular $2019$-gon of unit side length. One of them stands on a vertex and the other one is on the midpoint of the opposite side. They start walking along the perimeter at the same speed counterclockwise. The locus of their midpoints traces out a figure $P$ in the plane with $N$ corners. Let the area enclosed by the convex hull of $P$ be $\tfrac{A}{B}\tfrac{\sin^m\left(\tfrac{\pi}{4038}\right)}{\tan\left(\tfrac{\pi}{2019}\right)}$, where $A$ and $B$ are coprime positive integers, and $m$ is the smallest possible positive integer such that this formula holds. Find $A+B+m+N$. [i]Note:[/i] The [i]convex hull[/i] of a figure $P$ is the convex polygon of smallest area which contains $P$.

The vertices of a triangle are lattice points. There are no lattice points on the sides (apart from the vertices) and $n$ lattice points inside the triangle. Show that its area is $n + \frac12$. Find the formula for the general case where there are also $m$ lattice points on the sides (apart from the vertices).

From the vertices of a regular 27-gon, seven are chosen arbitrarily. Prove that among these seven points there are three points that form an isosceles triangle or four points that form an isosceles trapezoid.

Each point of the sphere of radius $r\ge 1$ is colored in one of $n$ colors ($n \ge 2$), and for each color there is a point on the sphere colored in this color. Prove that there are points $A_i$, $B_i$, $i= 1, ..., n$ on the sphere such that the colors of the points $A_1, ..., A_n$ are pairwise different and the color of the point $B_i$ at a distance of $1$ from $A_i$ is different from the color of the point $A_1, i= 1, ..., n$

There are $100$ points of general position marked on the plane (i.e. no three lie on the same straight line). Prove that it is possible to select three marked points $A, B, C$ so that for any point $D$ of the remaining $97$ marked points, the lines $AD$ and $CD$ would not contain points lying inside the triangle $ABC$.

There are $2015$ distinct circles in a plane, with radius $1$. Prove that you can select $27$ circles, which form a set $C$, which satisfy the following. For two arbitrary circles in $C$, they intersect with each other or For two arbitrary circles in $C$, they don't intersect with each other.

The plane is divided by three infinite sets of parallel lines into equilateral triangles of equal area. Let $M$ be the set of their vertices, and $A$ and $B$ be two vertices of such an equilateral triangle. One may rotate the plane through $120^o$ around any vertex of the set $M$. Is it possible to move the point $A$ to the point $B$ by a number of such rotations (N Vasiliev, Moscow)

There are 6 lines in space, of which no 3 are parallel, no 3 pass through the same point, and no 3 are contained in the same plane. Prove that among these 6 lines there are 3 mutually oblique lines.

Consider a right-angled triangle whose legs are $1$ cm long. Suppose that each point of the triangle was assigned a color from the set of Brown, Blue, Green and Orange colors. It proves that, whatever way this was done, there is at least one pair of points of the same color at a distance equal to or greater than $2-\sqrt 2$ cm from each other.

In space are given $24$ points, no three of which are collinear. Suppose that there are exactly $2002$ planes determined by three of these points. Prove that there is a plane containing at least six points.

Let $k$ be a positive integer. Find all positive integers $n$, such that it is possible to mark $n$ points on the sides of a triangle (different from its vertices) and connect some of them with a line in such a way that the following conditions are satisfied: 1) there is at least $1$ marked point on each side, 2) for each pair of points $X$ and $Y$ marked on different sides, on the third side there exist exactly $k$ marked points which are connected to both $X$ and $Y$ and exactly k points which are connected to neither $X$ nor $Y$

Find the number of rectangles who have the following properties: a) Have for vertices, points $(x,y)$ of plane $Oxy$ with $x,y$ non negative integers and $ x \le 8$ , $y\le 8$ b) Have sides parallel to axes c) Have area $E$, with $30<E\le 40$

Find all positive integer $k$ such that one can find a number of triangles in the Cartesian plane, the centroid of each triangle is a lattice point, the union of these triangles is a square of side length $k$ (the sides of the square are not necessarily parallel to the axis, the vertices of the square are not necessarily lattice points), and the intersection of any two triangles is an empty-set, a common point or a common edge.

Given two points inside a convex dodecagon (twelve sides) situated $10$ cm far from each other. Prove that the difference between the sum of distances, from the point to all the vertices, is less than $1$ m for those points.

A museum has the shape of a (not necessarily convex) 3$n$-gon. Prove that $n$ custodians can be positioned so as to control all of the museum’s space.

Let $n, k \geq 3$ be integers, and let $S$ be a circle. Let $n$ blue points and $k$ red points be chosen uniformly and independently at random on the circle $S$. Denote by $F$ the intersection of the convex hull of the red points and the convex hull of the blue points. Let $m$ be the number of vertices of the convex polygon $F$ (in particular, $m=0$ when $F$ is empty). Find the expected value of $m$.

Let $n\ge 3$ be an integer. An [i]inner diagonal[/i] of a [i]simple $n$-gon[/i] is a diagonal that is contained in the $n$-gon. Denote by $D(P)$ the number of all inner diagonals of a simple $n$-gon $P$ and by $D(n)$ the least possible value of $D(Q)$, where $Q$ is a simple $n$-gon. Prove that no two inner diagonals of $P$ intersect (except possibly at a common endpoint) if and only if $D(P)=D(n)$. [i]Remark:[/i] A simple $n$-gon is a non-self-intersecting polygon with $n$ vertices. A polygon is not necessarily convex.