A line meets a segment $AB$ at point $C$. Which is the maximal number of points $X$ of this line such that one of angles $AXC$ and $BXC$ is equlal to a half of the second one?

Anna and Brian play a game where they put the domino tiles (of size $2 \times 1$) in a boards composed of $n \times 1$ boxes. Tiles must be placed so that they cover exactly two boxes. Players take turnslaying each tile and the one laying last tile wins. They play once for each $n$, where $n = 2, 3,\dots,2007$. Show that Anna wins at least $1505$ of the games if she always starts first and they both always play optimally, ie if they do their best to win in every move.

Ten points are marked in the plane so that no three of them lie on a line. Each pair of points is connected with a segment. Each of these segments is painted with one of $k$ colors, in such a way that for any $k$ of the ten points, there are $k$ segments each joining two of them and no two being painted with the same color. Determine all integers $k$, $1\leq k\leq 10$, for which this is possible.

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)

Is it possible to draw in the plane the graph presented in the figure so that all the vertices are different points and all the edges are unit segments? (The segments can intersect at points different from vertices.)

a) A bus network is organized so that: 1) one can reach any stop from any other stop without changing buses; 2) every pair of routes has a single stop at which one can change buses; 3) each route has exactly three stops? How many bus routes are there? It is assumed that there are at least two routes. b) A town has $57$ bus routes. How many stops does each route have if it is known that 1) one can reach any stop from any other stop without changing buses; 2) for every pair of routes there is a single stop where one can change buses; 3) each route has three or more stops?

There are $2017$ distinct points in the plane. For each pair of these points, construct the midpoint of the segment joining the pair of points. What is the minimum number of distinct midpoints among all possible ways of placing the points?

$n$ diameters divide a disk into $2n$ equal sectors. $n$ of the sectors are coloured blue , and the other $n$ are coloured red (in arbitrary order) . Blue sectors are numbered from $1$ to $n$ in the anticlockwise direction, starting from an arbitrary blue sector, and red sectors are numbered from $1$ to $n$ in the clockwise direction, starting from an arbitrary red sector. Prove that there is a semi-disk containing sectors with all numbers from $1$ to $n$. (V Proizvolov)

A non self-intersecting polygon is given in a Cartesian coordinate system such that its perimeter contains no lattice points, and its vertices have no integer coordinates. A point is called semi-integer if exactly one of its coordinates is an integer. Let $P_1, P_2,\ldots, P_k$ denote the semi-integer points on the perimeter of the polygon. Let ni denote the floor of the non-integer coordinate of $P_i$. Prove that integers $n_1,n_2,\ldots ,n_k$ can be divided into two groups with the same sum. [i]Proposed by Áron Bán-Szabó, Budapest[/i]

Let \(n\) be a positive integer and consider an \(n\times n\) square grid. For \(1\le k\le n\), a [i]python[/i] of length \(k\) is a snake that occupies \(k\) consecutive cells in a single row, and no other cells. Similarly, an [i]anaconda[/i] of length \(k\) is a snake that occupies \(k\) consecutive cells in a single column, and no other cells. The grid contains at least one python or anaconda, and it satisfies the following properties: [list] [*]No cell is occupied by multiple snakes. [*]If a cell in the grid is immediately to the left or immediately to the right of a python, then that cell must be occupied by an anaconda. [*]If a cell in the grid is immediately to above or immediately below an anaconda, then that cell must be occupied by a python. [/list] Prove that the sum of the squares of the lengths of the snakes is at least \(n^2\). [i]Proposed by Linus Tang[/i]

There is a king in the lower left corner of a chessboard of dimensions $6$ and $6$. In one move, he can move either one cell to the right, or one cell up, or one cell diagonally - to the right and up. How many different paths can the king take to the upper right corner of the board?

Let $M$ be a finite subset of the plane such that for any two different points $A,B\in M$ there is a point $C\in M$ such that $ABC$ is equilateral. What is the maximal number of points in $M?$

We are given $N$ lines ($N > 1$ ) in a plane, no two of which are parallel and no three of which have a point in common. Prove that it is possible to assign, to each region of the plane determined by these lines, a non-zero integer of absolute value not exceeding $N$ , such that the sum of the integers o n either side of any of the given lines is equal to $0$ . (S . Fomin, Leningrad)

It is known that there are polyhedrons whose faces are more numbered than the vertices. Find the smallest number of triangular faces that such a polyhedron can have.

There are a thousand non-intersecting arcs on a circle, and on each of them contains two natural numbers. Sum of numbers of each arc is divided by the product of the numbers of the arc following it clockwise arrow. What is the largest possible value of the largest number written?

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?

Rosemonde is stacking spheres to make pyramids. She constructs two types of pyramids $S_n$ and $T_n$. The pyramid $S_n$ has $n$ layers, where the top layer is a single sphere and the $i^{th}$ layer is an $i\times $i square grid of spheres for each $2 \le i \le n$. Similarly, the pyramid $T_n$ has $n$ layers where the top layer is a single sphere and the $i^{th}$ layer is $\frac{i(i+1)}{2}$ spheres arranged into an equilateral triangle for each $2 \le i \le n$.

Let $P_1, ... , P_{2556}$ be distinct points in a regular hexagon $ABCDEF$ with unit side length. Suppose that no three points in the set $S = \{A, B, C, D, E, F, P_1, ... , P_{2556}\}$ are collinear. Show that there is a triangle whose vertices are in $S$ and whose area is less than $\frac{1}{1700}$ .

A [i]beautiful configuration[/i] of points is a set of $n$ colored points, such that if a triangle with vertices in the set has an angle of at least $120$ degrees, then exactly 2 of its vertices are colored with the same color. Determine the maximum possible value of $n$.

Prove that there exists a positive constant $c$ such that the following statement is true: Consider an integer $n > 1$, and a set $\mathcal S$ of $n$ points in the plane such that the distance between any two different points in $\mathcal S$ is at least 1. It follows that there is a line $\ell$ separating $\mathcal S$ such that the distance from any point of $\mathcal S$ to $\ell$ is at least $cn^{-1/3}$. (A line $\ell$ separates a set of points S if some segment joining two points in $\mathcal S$ crosses $\ell$.) [i]Note. Weaker results with $cn^{-1/3}$ replaced by $cn^{-\alpha}$ may be awarded points depending on the value of the constant $\alpha > 1/3$.[/i] [i]Proposed by Ting-Feng Lin and Hung-Hsun Hans Yu, Taiwan[/i]

$A_0A_1\ldots A_n$ is a regular polygon with $n+1$ vertices ($n>2$). Initially $n$ stones are placed at vertex $A_0$. In each allowed operation, $2$ stones are moved simultaneously, at the player's choice: each stone is moved from the vertex where it is located to one of the adjacent $2$ vertices. Find all the values of $n$ for which it is possible to have, after a succession of permitted operations, a stone at each of the vertices $A_1,A_2,\ldots ,A_n$. Clarification: The two stones that move in an allowed operation can be at the same vertex or at different vertices.

In each unit square of an infinite square grid a natural number is written. The polygons of area $n$ with sides going along the gridlines are called [i]admissible[/i], where $n > 2$ is a given natural number. The [i]value [/i] of an admissible polygon is defined as the sum of the numbers inside it. Prove that if the values of any two congruent admissible polygons are equal, then all the numbers written in the unit squares of the grid are equal. (We recall that a symmetric image of polygon $P$ is congruent to $P$.)

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

Find all triangles that can be divided into congruent right-angled isosceles triangles with side lengths $1, 1, \sqrt{2}$.

The plan of a Martian underground is represented by a closed selfintersecting curve, with at most one self-intersection at each point. Prove that a tunnel for such a plan may be constructed in such a way that the train passes consecutively over and under the intersecting parts of the tunnel.