we named a $n*n$ table $selfish$ if we number the row and column with $0,1,2,3,...,n-1$.(from left to right an from up to down) for every {$ i,j\in{0,1,2,...,n-1}$} the number of cell $(i,j)$ is equal to the number of number $i$ in the row $j$. for example we have such table for $n=5$ 1 0 3 3 4 1 3 2 1 1 0 1 0 1 0 2 1 0 0 0 1 0 0 0 0 prove that for $n>5$ there is no $selfish$ table

Prove it is possible to find $2^{2021}$ different pairs of positive integers $(a_i,b_i)$ such that: $$ \frac{1}{a_ib_i}+\frac{1}{a_2b_2} + \ldots + \frac{1}{a_{2^{2021}}b_{2^{2021}}} = 1 $$ $$ a_1+a_2 +\ldots a_{2^{2021}} +b_1+b_2 + \ldots +b_{2^{2021}} = 3^{2022} $$ [b]Note: [/b]Pairs $(a,b)$ and $(c,d)$ are different if $a \neq c$ or $b \neq d$

Let $n\ge 3$ be an integer. Consider $n$ points in the plane, no three lying on the same line, and a squirrel in each one of them. Alex wants to give hazelnuts to the squirrels, so he proceeds as follows: for each convex polygon with vertices among the n points, he identifies the squirrels which lie on its sides or in its interior and gives to each of these squirrels q hazelnuts, where q is their number. At the end of the process, a squirrel with the least number of hazelnuts is called unlucky. Determine the maximum number of hazelnuts an unlucky squirrel can get. ([i]proposed by Cristi Savesku[/i])

A maths teacher has $10$ cards with the numbers $1$ to $10$ on them, one number per card. She places these cards in some order in a line next to each other on the table. The students come to the table, one at a time. The student whose turn it is goes once through the line of cards from left to right and removes every card she encounters that is (at that moment) the lowest card on the table. This continues till all cards are removed from the table. For example, if the line is in order $3$, $1$, $4$, $5$, $8,$ $6$, $9$, $10$, $2$, $7$ from left to right, the first student takes cards $1$ and $2$. Then the second student comes who, in our example, takes the cards $3$, $4$, $5$, $6$, and $7$. The third student then takes the cards $8$, $9$, and $10$. Let $A$ be the number of sequences of cards that the teacher can choose so that exactly nine students get a turn to pick cards. Let $B$ be the number of sequences of cards that the teacher can choose so that exactly two students get a turn to pick cards. Prove that $A = B$.

The LHS Math Team is going to have a Secret Santa event! Nine members are going to participate, and each person must give exactly one gift to a specific recipient so that each person receives exactly one gift. But to make it less boring, no pairs of people can just swap gifts. The number of ways to assign who gives gifts to who in the Secret Santa Exchange with these constraints is $N$. Find the remainder when $N$ is divided by $1000$.

A [i]snake of length $k$[/i] is an animal which occupies an ordered $k$-tuple $(s_1, \dots, s_k)$ of cells in a $n \times n$ grid of square unit cells. These cells must be pairwise distinct, and $s_i$ and $s_{i+1}$ must share a side for $i = 1, \dots, k-1$. If the snake is currently occupying $(s_1, \dots, s_k)$ and $s$ is an unoccupied cell sharing a side with $s_1$, the snake can [i]move[/i] to occupy $(s, s_1, \dots, s_{k-1})$ instead. The snake has [i]turned around[/i] if it occupied $(s_1, s_2, \dots, s_k)$ at the beginning, but after a finite number of moves occupies $(s_k, s_{k-1}, \dots, s_1)$ instead. Determine whether there exists an integer $n > 1$ such that: one can place some snake of length $0.9n^2$ in an $n \times n$ grid which can turn around. [i]Nikolai Beluhov[/i]

$N$ in natural. There are natural numbers from $N^3$ to $N^3+N$ on the board. $a$ numbers was colored in red, $b$ numbers was colored in blue. Sum of red numbers in divisible by sum of blue numbers. Prove, that $b|a$

An [i]$n$-type triangle[/i] where $n\geqslant 2$ is formed by the cells of a $(2n+1)\times(2n+1)$ board, situated under both main diagonals. For instance, a $3$-type triangle looks like this:[img]https://i.ibb.co/k4fmwWY/Screenshot-2024-07-31-153932.png[/img]Determine the maximal length of a sequence with pairwise distinct cells in an $n$-type triangle, such that, beggining with the second one, any cell of the sequence has a common side with the previous one. [i]Cristi Săvescu[/i]

Consider the lattice $ L$ of the contradictions of a simple graph $ G$ (as sets of vertex pairs) with respect to inclusion. Let $ n \geq 1$ be an arbitrary integer. Show that the identity \[ x \bigwedge \left( \bigvee_{i\equal{}0}^n y_i \right) \equal{} \bigvee_{j\equal{}0}^n \left( x \bigwedge \left( \bigvee_{0 \leq i \leq n, \;i\not\equal{}j\ } y_i \right)\right)\] holds if and only if $ G$ has no cycle of size at least $ n\plus{}2$. [i]A. Huhn[/i]

A real number is assigned to each vertex of a triangular prism so that the number on any vertex is the arithmetic mean of the numbers on the three adjacent vertices. Prove that all six numbers are equal.

Count the number $N$ of all sets $A:=\{x_1,x_2,x_3,x_4\}$ of non-negative integers satisfying $$x_1+x_2+x_3+x_4=36$$ in at least four different ways. [i]Proposed by Eugene J. Ionaşcu[/i]

We have $ n \geq 2$ lamps $ L_{1}, . . . ,L_{n}$ in a row, each of them being either on or off. Every second we simultaneously modify the state of each lamp as follows: if the lamp $ L_{i}$ and its neighbours (only one neighbour for $ i \equal{} 1$ or $ i \equal{} n$, two neighbours for other $ i$) are in the same state, then $ L_{i}$ is switched off; – otherwise, $ L_{i}$ is switched on. Initially all the lamps are off except the leftmost one which is on. $ (a)$ Prove that there are infinitely many integers $ n$ for which all the lamps will eventually be off. $ (b)$ Prove that there are infinitely many integers $ n$ for which the lamps will never be all off.

Isaac repeatedly flips a fair coin. Whenever a particular face appears for the $2n+1$th time, for any nonnegative integer $n$, he earns a point. The expected number of flips it takes for Isaac to get $10$ points is $\tfrac ab$ for coprime positive integers $a$ and $b$. Find $a + b$. [i]Proposed by Isaac Chen[/i]

The finite sets $A_1$, $A_2$, $\ldots$, $A_n$ are given and we denote by $d(n)$ the number of elements which appear exactly in an odd number of sets chosen from $A_1$, $A_2$, $\ldots$, $A_n$. Prove that for any $k$, $1\leq k\leq n$ the number \[{ d(n) - \sum\limits^n_{i=1} |A_i| + 2\sum\limits_{ i<j} |A_i \cap A_j | - \cdots + (-1)^k2^{k-1} \sum\limits_{i_1 <i_2 <\cdots < i_k} | A_{i_1} \cap A_{i_2} \cap \cdots \cap A_{i_k}}| \] is divisible by $2^k$. [i]Ioan Tomescu, Dragos Popescu[/i]

Two players are playing the following game. They are alternatively putting blue and red coins on the board $2018$ by $2018$. If first player creates $n$ blue coins in a row or column, he wins. Second player wins if he can prevent it. Who will win if: $a)n=4$; $b)n=5$? Note: first player puts only blue coins, and second only red.

Integers $1$ to $36$ are written in each "Neuro-Millions" bulletin. A bet on "Neuro-Millions" consists of choosing $6$ of these $36$ numbers. Then, $6$ numbers between $1$ and $36$ are drawn, and these constitute the key to "Neuro-Milh˜oes". A bet is awarded if it does not contain any of the key numbers. How many bets, at least, are necessary to guarantee a prize?

There are $m$ villages on the left bank of the Lena, $n$ villages on the right bank and one village on an island. It is known that $(m+1,n+1)>1$. Every two villages separated by water are connected by ferry with positive integral number. The inhabitants of each village say that all the ferries operating in their village have different numbers and these numbers form a segment of the series of the integers. Prove that at least some of them are wrong. [i](K. Kokhas)[/i]

Let $n > 3$ be an integer. Let $\Omega$ be the set of all triples of distinct elements of $\{1, 2, \ldots , n\}$. Let $m$ denote the minimal number of colours which suffice to colour $\Omega$ so that whenever $1\leq a<b<c<d \leq n$, the triples $\{a,b,c\}$ and $\{b,c,d\}$ have different colours. Prove that $\frac{1}{100}\log\log n \leq m \leq100\log \log n$.

Lamija and Faris are playing the following game. Cards, which are numerated from $1$ to $100$, are placed one next to other, starting from $1$ to $100$. Now Faris picks every $7$th card, and after that every card which contains number $7$. After that Lamija picks from remaining cards ones divisible with $5$, and after that cards which contain number $5$. Who will have more cards and how many ? How would game end, if Lamija started with "$5$ rule" and Faris continues with "$7$ rule"?

In ancient times there was a Celtic tribe consisting of several families. Many of these families were at odds with each other, so that their chiefs would not shake hands. At some point at the annual meeting of the chiefs they found it even impossible to assemble four or more of them in a circle with each of them being willing to shake his neighbour's hand. To emphasize the gravity of the situation, the Druid collected three pieces of gold from each family. The Druid then let all those chiefs shake hands who were willing to. For each handshake of two chiefs he paid each of them a piece of gold as a reward. Show that the number of pieces of gold collected by the Druid exceeds the number of pieces paid out by at least three.

In Wonderland there are at least $5$ towns. Some towns are connected directly by roads or railways. Every town is connected to at least one other town and for any four towns there exists some direct connection between at least three pairs of towns among those four. When entering the public transportation network of this land, the traveller must insert one gold coin into a machine, which lets him use a direct connection to go to the next town. But if the traveller continues travelling from some town with the same method of transportation that took him there, and he has paid a gold coin to get to this town, then going to the next town does not cost anything, but instead the traveller gains the coin he last used back. In other cases he must pay just like when starting travelling. Prove that it is possible to get from any town to any other town by using at most $2$ gold coins.

Determine all natural numbers $n \ge 2$ with the property that there are two permutations $(a_1, a_2,... , a_n) $ and $(b_1, b_2,... , b_n)$ of the numbers $1, 2,..., n$ such that $(a_1 + b_1, a_2 +b_2,..., a_n + b_n)$ are consecutive natural numbers. [i](Walther Janous)[/i]

A $100 \times 100$ table is given. At the beginning, every unit square has number $"0"$ written in them. Two players playing a game and the game stops after $200$ steps (each player plays $100$ steps). In every step, one can choose a row or a column and add $1$ to the written number in all of it's squares $\pmod 3.$ First player is the winner if more than half of the squares ($5000$ squares) have the number $"1"$ written in them, Second player is the winner if more than half of the squares ($5000$ squares) have the number $"0"$ written in them. Otherwise, the game is draw. Assume that both players play at their best. What will be the result of the game ? [i]Proposed by Mahyar Sefidgaran[/i]

Recall that an icosahedron is a $3$-dimensional solid characterized by its $20$ congruent faces, each of which is an equilateral triangle. Determine the number of rigid rotations that preserve the symmetry of the icosahedron. (Each vertex moves to the location of another vertex.)

Let $n\geq 3$ be a fixed integer. Each side and each diagonal of a regular $n$-gon is labelled with a number from the set $\left\{1;\;2;\;...;\;r\right\}$ in a way such that the following two conditions are fulfilled: [b]1.[/b] Each number from the set $\left\{1;\;2;\;...;\;r\right\}$ occurs at least once as a label. [b]2.[/b] In each triangle formed by three vertices of the $n$-gon, two of the sides are labelled with the same number, and this number is greater than the label of the third side. [b](a)[/b] Find the maximal $r$ for which such a labelling is possible. [b](b)[/b] [i]Harder version (IMO Shortlist 2005):[/i] For this maximal value of $r$, how many such labellings are there? [hide="Easier version (5th German TST 2006) - contains answer to the harder version"] [i]Easier version (5th German TST 2006):[/i] Show that, for this maximal value of $r$, there are exactly $\frac{n!\left(n-1\right)!}{2^{n-1}}$ possible labellings.[/hide] [i]Proposed by Federico Ardila, Colombia[/i]