The Hawking Space Agency operates $n-1$ space flights between the $n$ habitable planets of the Local Galaxy Cluster. Each flight has a fixed price which is the same in both directions, and we know that using these flights, we can travel from any habitable planet to any habitable planet. In the headquarters of the Agency, there is a clearly visible board on a wall, with a portrait, containing all the pairs of different habitable planets with the total price of the cheapest possible sequence of flights connecting them. Suppose that these prices are precisely $1,2, ... , \binom{n}{2}$ monetary units in some order. prove that $n$ or $n-2$ is a square number.

Given an $m \times n$ table consisting of $mn$ unit cells. Alice and Bob play the following game: Alice goes first and the one who moves colors one of the empty cells with one of the given three colors. Alice wins if there is a figure, such as the ones below, having three different colors. Otherwise Bob is the winner. Determine the winner for all cases of $m$ and $n$ where $m, n \ge 3$. Proposed by [i]Toghrul Abbasov, Azerbaijan[/i]

There is a sequence of integers $ a_1, a_2, \ldots, a_{2n+1} $ with the following property: after eliminating any term, the remaining ones can be divided into two groups of $ n $ terms such that the sum of the terms in the first group is equal to the sum words in the second. Prove that all terms of the sequence are equal.

A grid of cells is tiled with dominoes such that every cell is covered by exactly one domino. A subset $S$ of dominoes is chosen. Is it true that at least one of the following 2 statements is false? (1) There are $2022$ more horizontal dominoes than vertical dominoes in $S$. (2) The cells covered by the dominoes in $S$ can be tiled completely and exactly by $L$-shaped tetrominoes.

Let $A\subset \{1,2,\ldots,4014\}$, $|A|=2007$, such that $a$ does not divide $b$ for all distinct elements $a,b\in A$. For a set $X$ as above let us denote with $m_{X}$ the smallest element in $X$. Find $\min m_{A}$ (for all $A$ with the above properties).

Let $n$ be a positive integer and $a_1,a_2,\dots,a_n$ be integers. Function $f: \mathbb{Z} \rightarrow \mathbb{R}$ is such that for all integers $k$ and $l$, $l \neq 0$, $$\sum_{i=1}^n f(k+a_il)=0.$$ Prove that $f \equiv 0$.

Determine the largest natural number $ N $ having the following property: every $ 5\times 5 $ array consisting of pairwise distinct natural numbers from $ 1 $ to $ 25 $ contains a $ 2\times 2 $ subarray of numbers whose sum is, at least, $ N. $ [i]Demetres Christofides[/i] and [i]Silouan Brazitikos[/i]

Consider a convex polygon in a plane such that the length of all edges and diagonals are rational. After connecting all diagonals, prove that any length of a segment is rational.

Within an arithmetic progression of length $ 2005, $ find the number of arithmetic subprogressions of length $ 501 $ that don't contain the $ \text{1000-th} $ term of the progression.

Suppose that $n\ge 8$ persons $P_1,P_2,\dots,P_n$ meet at a party. Assume that $P_k$ knows $k+3$ persons for $k=1,2,\dots,n-6$. Further assume that each of $P_{n-5},P_{n-4},P_{n-3}$ knows $n-2$ persons, and each of $P_{n-2},P_{n-1},P_n$ knows $n-1$ persons. Find all integers $n\ge 8$ for which this is possible. (It is understood that "to know" is a symmetric nonreflexive relation: if $P_i$ knows $P_j$ then $P_j$ knows $P_i$; to say that $P_i$ knows $p$ persons means: knows $p$ persons other than herself/himself.)

For a sequence $x_1,x_2,\ldots,x_n$ of real numbers, we define its $\textit{price}$ as \[\max_{1\le i\le n}|x_1+\cdots +x_i|.\] Given $n$ real numbers, Dave and George want to arrange them into a sequence with a low price. Diligent Dave checks all possible ways and finds the minimum possible price $D$. Greedy George, on the other hand, chooses $x_1$ such that $|x_1 |$ is as small as possible; among the remaining numbers, he chooses $x_2$ such that $|x_1 + x_2 |$ is as small as possible, and so on. Thus, in the $i$-th step he chooses $x_i$ among the remaining numbers so as to minimise the value of $|x_1 + x_2 + \cdots x_i |$. In each step, if several numbers provide the same value, George chooses one at random. Finally he gets a sequence with price $G$. Find the least possible constant $c$ such that for every positive integer $n$, for every collection of $n$ real numbers, and for every possible sequence that George might obtain, the resulting values satisfy the inequality $G\le cD$. [i]Proposed by Georgia[/i]

For each natural number $n\ge3$, let $m(n)$ be the maximum number of points inside or on the sides of a regular $n$-agon of side $1$ such that the distance between any two points is greater than $1$. Prove that $m(n)\ge n$ for $n>6$.

There is a $11\times 11$ square grid. We divided this in $5$ rectangles along unit squares. How many ways that one of the rectangles doesn’t have a edge on basic circumference. Note that we count as different ways that one way coincides with another way by rotating or reversing.

On an infinite square grid, Gru and his $2022$ minions play a game, making moves in a cyclic order with Gru first. On any move, the current player selects $2$ adjacent cells of their choice, and paints their shared border. A border cannot be painted over more than once. Gru wins if after any move there is a $2 \times 1$ or $1 \times 2$ subgrid with its border (comprising of $6$ segments) completely colored, but the $1$ segment inside it uncolored. Can he guarantee a win? [i]Evan Chang[/i] [size=50](oops)[/size]

In how many ways can one arrange seven white and five black balls in a line in such a way that there are no two neighboring black balls?

Prove that the vertices of any planar graph can be colored with $3$ colors such that there is no monochromatic cycle.

A class has 30 students. To celebrate 'Tu BiShvat' each student chose some dried fruits out of $n$ different kinds. Say two students are friends if they both chose from the same type of fruit. Find the minimal $n$ so that it is possible that each student has exactly \(6\) friends.

For a natural number $n \ge 3$ we denote by $M(n)$ the minimum number of unit squares that must be coloured in a $6 \times n$ rectangle so that any possible $2 \times 3$ rectangle (it can be rotated, but it must be contained inside and cannot be cut) contains at least one coloured unit square. Is it true that for every natural $n \ge 3$ the number $M(n)$ can be expressed as $M(n)=p_n+k_n^3$, where $p_n$ is a prime and $k_n$ is a natural number?

How many ways are there to express $2548$ as a sum of at least two positive integers, where two sums that differ in order are considered different?

Subsets $S$ of the first 3$5$ positive integers $\{1, 2, 3, ..., 35\}$ are called [i]contrived [/i] if $S$ has size $4$ and the sum of the squares of the elements of $S$ is divisible by $7$. Find the number of contrived sets.

Let $G$ be a simple graph on the infinite vertex set $V=\{v_1, v_2, v_3,\ldots\}$. Suppose every subgraph of $G$ on a finite vertex subset is $10$-colorable, Prove that $G$ itself is $10$-colorable.

In the cells of an $8\times 8$ board, marbles are placed one by one. Initially there are no marbles on the board. A marble could be placed in a free cell neighboring (by side) with at least three cells which are still free. Find the greatest possible number of marbles that could be placed on the board according to these rules.

Twenty-one girls and twenty-one boys took part in a mathematical competition. It turned out that each contestant solved at most six problems, and for each pair of a girl and a boy, there was at least one problem that was solved by both the girl and the boy. Show that there is a problem that was solved by at least three girls and at least three boys.

The closed interval $A = [0, 50]$ is the union of a finite number of closed intervals, each of length $1$. Prove that some of the intervals can be removed so that those remaining are mutually disjoint and have total length greater than $25$. Note: For reals $a\le b$, the closed interval $[a, b] := \{x\in \mathbb{R}:a\le x\le b\}$ has length $b-a$; disjoint intervals have [i]empty [/i]intersection.

What greatest number of triples of points can be selected from $1955$ given points, so that each two triples have one common point?