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

Prove that exists triangle that can be partitions in $2050$ congruent triangles.

Two decompositions of a square into three rectangles are called substantially different, if reordering the rectangles does not change one into the other. How many substantially different decompositions of a $2010 \times 2010$ square in three rectangles with integer side lengths are there such that the area of one rectangle is equal to the arithmetic mean of the areas of the other rectangles?

There are two very strict laws in the country of Militaria. (i) Anyone who is shorter than $80\%$ (or more) of his “neighbours” (i.e. men living at distance less then $r$ from him) is freed from the military service. (ii) Anyone who is taller than $80\%$ (or more) of his “neighbours” (i.e. men living at distance less then $R$ from him) is allowed to serve in the police. A nice thing is that each man $X$ may choose his own (possibly different) positive numbers $r = r(X)$ and $R = R(X)$. Can it happen that $90\%$ (or more) of the men in Militaria are free from the army and, at the same time, $90\%$ (or more) of the men in Militaria are allowed to serve in the police? (The places of living of the men are fixed points in the plane.) (N Konstantinov)

Let $a$ and $b$ be two positive integers satifying $gcd(a, b) = 1$. Consider a pawn standing on the grid point $(x, y)$. A step of type A consists of moving the pawn to one of the following grid points: $(x+a, y+a),(x+a,y-a), (x-a, y + a)$ or $(x - a, y - a)$. A step of type B consists of moving the pawn to $(x + b,y + b),(x + b,y - b), (x - b,y + b)$ or $(x - b,y - b)$. Now put a pawn on $(0, 0)$. You can make a (nite) number of steps, alternatingly of type A and type B, starting with a step of type A. You can make an even or odd number of steps, i.e., the last step could be of either type A or type B. Determine the set of all grid points $(x,y)$ that you can reach with such a series of steps.

For which natural number $n$ is it possible to draw $n$ line segments between vertices of a regular $2n$-gon so that every vertex is an endpoint for exactly one segment and these segments have pairwise different lengths?

Do there exist 100 points on the plane such that the pairwise distances between them are pairwise distinct consecutive integer numbers larger than 2022?

Given a convex polygon, show that it has three consecutive vertices such that the circle through them contains the polygon.

To each side of the regular $p$-gon of side length $1$ there is attached a $1 \times k$ rectangle, partitioned into $k$ unit cells, where $k$ and $p$ are given positive integers and p an odd prime. Let $P$ be the resulting nonconvex star-like polygonal figure consisting of $kp + 1$ regions ($kp$ unit cells and the $p$-gon). Each region is to be colored in one of three colors, adjacent regions having different colors. Furthermore, it is required that the colored figure should not have a symmetry axis. In how many ways can this be done?

Prove that an arbitrary triangle can be cut into three polygons, one of which must be an obtuse triangle, so that they can then be folded into a rectangle. (Turning over parts is possible).

A cube is partitioned into finitely many rectangular parallelepipeds with the edges parallel to the edges of the cube. Prove that if the sum of the volumes of the circumspheres of these parallelepipeds equals the volume of the circumscribed sphere of the cube, then all the parallelepipeds are cubes.

In a country there are $2014$ airports, no three of them lying on a line. Two airports are connected by a direct flight if and only if the line passing through them divides the country in two parts, each with $1006$ airports in it. Show that there are no two airports such that one can travel from the first to the second, visiting each of the $2014$ airports exactly once.

Nair has puzzle pieces shaped like an equilateral triangle. She has pieces of two sizes: large and small. [img]https://cdn.artofproblemsolving.com/attachments/a/1/aedfbfb2cb17bf816aa7daeb0d35f46a79b6e9.jpg[/img] Nair build triangular figures by following these rules: $\bullet$ Figure $1$ is made up of $4$ small pieces, Figure $2$ is made up of $2$ large pieces and $8$ small, Figure $3$ by $6$ large and $12$ small, and so on. $\bullet$ The central column must be made up exclusively of small parts. $\bullet$ Outside the central column, only large pieces can be placed. [img]https://cdn.artofproblemsolving.com/attachments/5/7/e7f6340de0e04d5b5979e72edd3f453f2ac8a5.jpg[/img] Following the pattern, how many pieces will Nair use to build Figure $20$?

In a triangle $T$, all the angles are less than $90^o$, and the longest side has length $s$. Show that for every point $p$ in $T$ we can pick a corner $h$ in $T$ such that the distance from $p$ to $h$ is less than or equal to $s/\sqrt3$.

We have $4n + 5$ points on the plane, no three of them are collinear. The points are colored with two colors. Prove that from the points we can form $n$ empty triangles (they have no colored points in their interiors) with pairwise disjoint interiors, such that all points occurring as vertices of the $n$ triangles have the same color.

Prove that three discs of radius $1$ cannot cover entirely a square surface of side $2$, but they can cover more than $99.75\%$ of it.

A positive integer $n < 2017$ is given. Exactly $n$ vertices of a regular 2017-gon are colored red, and the remaining vertices are colored blue. Prove that the number of isosceles triangles whose vertices are monochromatic does not depend on the chosen coloring (but does depend on $n$.)

A square is cut into $100$ rectangles by $9$ straight lines parallel to one of the sides and $9$ lines parallel to another. If exactly $9$ of the rectangles are actually squares, prove that at least two of these $9$ squares are of the same size . (V Proizvolov)

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.

There are $n$ points on a circle ($n > 1$). Denote them with $P_1,P_2, P_3, ..., P_n$ such that the polyline $P_1P_2P_3... P_n$ does not intersect itself. In how many ways is this possible?

A square is placed in the plane and a point $P$ is marked in this plane with invisible ink. A certain person can see this point through special glasses. One can draw a straight line and this person will say on which side of the line the point $P$ lies. If $P$ lies on the line, the person says so. What is the minimal number of questions one needs to find out if $P$ lies inside the square or not? (Folklore)

There are $11$ points equally spaced on a circle. Some of the segments having endpoints among these vertices are drawn and colored in two colors, so that each segment meets at an internal for it point at most one other segment from the same color. What is the greatest number of segments that could be drawn?

Let $k$ be a fixed positive integer. For each $n = 1, 2,...,$ we will call [i]configuration [/i] of order $n$ any set of $kn$ points of the plane, which does not contain $3$ collinear, colored with $k$ given colors, so that there are $n$ points of each color. Determine all positive integers $n$ with the following property: in each configuration of order $n$, it is possible to select three points of each color, such that the $k$ triangles with vertices of the same color that are determined are disjoint in pairs.

In a chess tournament $ 2n\plus{}3$ players take part. Every two play exactly one match. The schedule is such that no two matches are played at the same time, and each player, after taking part in a match, is free in at least $ n$ next (consecutive) matches. Prove that one of the players who play in the opening match will also play in the closing match.

In a plane are given $n > 2$ distinct points. Some pairs of these points are connected by segments so that no two of the segments intersect. Prove that there are at most $3n-6$ segments.