Let $\mathcal{S}$ be a set of $2023$ points in a plane, and it is known that the distances of any two different points in $S$ are all distinct. Ivan colors the points with $k$ colors such that for every point $P \in \mathcal{S}$, the closest and the furthest point from $P$ in $\mathcal{S}$ also have the same color as $P$. What is the maximum possible value of $k$? [i]Proposed by Ivan Chan Kai Chin[/i]

There is an infinite set of points $S$ on the plane, and any $1\times 1$ square contains a finite number of points from the set $S$. Prove that there are two different points $A$ and $B$ from $S$ such that for any other point $X$ from $S$ the following inequalities hold: $$|XA|, |XB| \ge 0.999|AB|.$$

Consider $n\geqslant 6$ coplanar lines, no two parallel and no three concurrent. These lines split the plane into unbounded polygonal regions and polygons with pairwise disjoint interiors. Two polygons are non-adjacent if they do not share a side. Show that there are at least $(n-2)(n-3)/12$ pairwise non-adjacent polygons with the same number of sides each.

Given several squares with the total area $1$. Prove that you can pose them in the square of the area $2$ without any intersections.

Can a square of side length $5$ be covered by three squares of side length $4$?

For each set $C$ of points in space, we designate by $P_C$ the set of planes containing at least three points of $C$. $\bullet$ Prove that there exists $C$ such that $\phi (P_C) = 1997$, where $\phi$ corresponds to the cardinality. $\bullet$ Determine the least number of points that $C$ must have so that the previous property can be fulfilled.

Let $n$ be a natural number. There are $n$ blue points , $n$ red points and one green point on the circle . Prove that it is possible to draw $n$ lengths whose ends are in the given points, so that a maximum of one segment emerges from each point, no more than two segments intersect and the endpoints of none of the segments are blue and red points. [hide=original wording]Нека je ? природан број. На кружници се налази ? плавих, ? црвених и једна зелена тачка. Доказати да је могуће повући ? дужи чији су крајеви у датим тачкама, тако да из сваке тачке излази максимално једна дуж, никоје две дужи се не сијеку и крајње тачке ниједне од дужи нису плава и црвена тачка.[/hide]

Suppose 2017 points in a plane are given such that no three points are collinear. Among the triangles formed by any three of these 2017 points, those triangles having the largest area are said to be [i]good[/i]. Prove that there cannot be more than 2017 good triangles.

Given a segment $AB$ of length $2003$ in a coordinate plane, determine the maximal number of unit squares with vertices in the lattice points whose intersection with the given segment is non-empty.

An equilateral triangle of side $n$ is divided into $n^2$ equilateral triangles of side $1$. A path is drawn along the sides of the triangles which passes through each vertex just once. Prove that the path makes an acute angle at at least $n$ vertices.

$n$ lines are given in the plane so that no three of them concur and no two are parallel. Show that there is a non-self-intersecting path consisting of $n$ straight segments so that each of the given lines contains exactly one of the segments of the path.

A paper triangle with the angles $20^o$, $20^o$ and $140^o$ is cut into two triangles by the bisector of one of its angles. Then one of these triangles is cut into two by its bisector, and so on. Prove that it is impossible to get a triangle similar to the initial one. (AI Galochkin)

* Given a regular dodecahedron. Find how many ways are there to draw a plane through it so that its section of the dodecahedron is a regular hexagon?

A point in the cartesian plane with integer coordinates is called a lattice point. Consider the following one player game. A finite set of selected lattice points and finite set of selected segments is called a position in this game if the following hold: (i) The endpoints of each selected segment are lattice points; (ii) Each selected segment is parallel to a coordinate axis or to one of the lines $y = \pm x$, (iii) Each selected segment contains exactly five lattice points, all of which are selected, (iv) Every two selected segments have at most one common point. A move in this game consists of selecting a lattice point and a segment such that the new set of selected lattice points and segments is a position. Prove or disprove that there exists an initial position such that the game can have infinitely many moves.

Does there exist a convex pentagon from which a similar pentagon can be cut off by a straight line? (S Tokarev)

Given three planes and a ball in space. In space, find the number of different ways of placing another ball so that it would be tangent the three given planes and the given ball. It is assumed that the balls can only touch externally.

In the plane, six circles are given so that none of the circles contain one the center of the other. Show that there is no point that lies in all the circles.

Initially, the point-like particles $A, B$ and $C{}$ are located respectively at the points $(0,0), (1,0)$ and $(0,1)$ in the coordinate plane. Every minute some two particles repel each other along the straight line connecting their current positions, moving the same (positive) distance. [list=a] [*]Can the particle $A{}$ be at the point $(3,3)$? What about the point $(2,3)$? [*]Can the particles $B{}$ and $C{}$ be at the same time at the points $(0,100)$ and $(100,0)$ respectively? [/list] [i]Proposed by K. Krivosheev[/i]

Let $E, F$ be two distinct points inside a parallelogram $ABCD$ . Determine the maximum possible number of triangles having the same area with three vertices from points $A, B, C, D, E, F$.

A polygon is decomposed into triangles by drawing some non-intersecting interior diagonals in such a way that for every pair of triangles of the triangulation sharing a common side, the sum of the angles opposite to this common side is greater than $180^o$. a) Prove that this polygon is convex. b) Prove that the circumcircle of every triangle used in the decomposition contains the entire polygon. [i]Proposed by Morteza Saghafian - Iran[/i]

(a) A point $A$ is marked inside a sphere. Three perpendicular lines drawn through $A$ intersect the sphere at six points. Prove that the centre of gravity of these six points does not depend on the choice of such three lines. (b) An icosahedron with the centre $A$ is placed inside a sphere (its centre does not necessarily coincide with the centre of the sphere). The rays going from $A$ to the vertices of the icosahedron mark $12$ points on the sphere. Then the icosahedron is rotated about its centre. New rays mark new $12$ points on the sphere. Let $O$ and $N$ be the centres of mass of old and new points respectively. Prove that $O = N$.

A connected checkered figure is drawn on a checkered paper. It is known that the figure can be cut both into $2\times 2$ squares and into (possibly rotated) [url=https://upload.wikimedia.org/wikipedia/commons/thumb/3/30/Tetromino-skew2.svg/1200px-Tetromino-skew2.svg.png]skew-tetrominoes[/url]. Prove that there is a hole in the figure. [i]Proposed by Y. Markelov and A. Sairanov[/i]

For $n\geq 2$ , an equilateral triangle is divided into $n^2$ congruent smaller equilateral triangles. Detemine all ways in which real numbers can be assigned to the $\frac{(n+1)(n+2)}{2}$ vertices so that three such numbers sum to zero whenever the three vertices form a triangle with edges parallel to the sides of the big triangle.

Turki has divided a square into finitely many white and green rectangles, each with sides parallel to the sides of the square. Within each white rectangle, he writes down its width divided by its height. Within each green rectangle, he writes down its height divided by its width. Finally, he calculates $S$, the sum of these numbers. If the total area of white rectangles equals the total area of green rectangles, determine the minimum possible value of $S$.

Given $n$ points, some of them connected by non-intersecting segments. You can reach every point from every one, moving along the segments, and there is no couple, connected by two different ways. Prove that the total number of the segments is $(n-1)$.