Lucy starts by writing $s$ integer-valued $2022$-tuples on a blackboard. After doing that, she can take any two (not necessarily distinct) tuples $\mathbf{v}=(v_1,\ldots,v_{2022})$ and $\mathbf{w}=(w_1,\ldots,w_{2022})$ that she has already written, and apply one of the following operations to obtain a new tuple: \begin{align*} \mathbf{v}+\mathbf{w}&=(v_1+w_1,\ldots,v_{2022}+w_{2022}) \\ \mathbf{v} \lor \mathbf{w}&=(\max(v_1,w_1),\ldots,\max(v_{2022},w_{2022})) \end{align*} and then write this tuple on the blackboard. It turns out that, in this way, Lucy can write any integer-valued $2022$-tuple on the blackboard after finitely many steps. What is the smallest possible number $s$ of tuples that she initially wrote?

Alice and Bob play a game on a complete graph $G$ with $2014$ vertices. They take moves in turn with Alice beginning. At each move Alice directs one undirected edge of $G$. At each move Bob chooses a positive integer number $m,$ $1 \le m \le 1000$ and after that directs $m$ undirected edges of $G$. The game ends when all edges are directed. If there is some directed cycle in $G$ Alice wins. Determine whether Alice has a winning strategy.

A mathematical contest had $3$ problems, each of which was given a score between $0$ and $7$ ($0$ and $7$ included). It is known that, for any two contestants, there exists at most one problem in which they have obtained the same score (for example, there are no two contestants whose ordered scores are $7,1,2$ and $7,1,5$, but there might be two contestants whose ordered scores are $7,1,2$ and $7,2,1$). Find the maximum number of contestants.

$10$ people are sitting at a round table. There are some nuts in front of each of them, $100$ nuts altogether. After a certain signal each person passes some of his nuts to the person sitting to his right . If he has an even number of nuts, he passes half of them; otherwise he passes one nut plus half of the remaining nuts. This procedure is repeated over and over again. Prove that eventually everyone will have exactly $10$ nuts. (A Shapovalov)

Let $n$ be an integer greater than or equal to $3$, and let $P_n$ be the collection of all planar (simple) $n$-gons no two distinct sides of which are parallel or lie along some line. For each member $P$ of $P_n$, let $f_n(P)$ be the least cardinal a cover of $P$ by triangles formed by lines of support of sides of $P$ may have. Determine the largest value $f_n(P)$ may achieve, as $P$ runs through $P_n$.

Let $A$ and $B$ be two $n \times n$ square arrays. The cells of $A$ are labelled by the numbers from $1$ to $n^2$ from left to right starting from the top row, whereas the cells of $B$ are labelled by the numbers from $1$ to $n^2$ along rising north-easterly diagonals starting with the upper left-hand corner. Stack the array $B$ on top of the array $A$. If two overlapping cells have the same number, they are coloured red. Determine those $n$ for which there is at least one red cell other than the cells at top left corner, bottom right corner and the centre (when $n$ is odd). Below shows the arrays for $n=4$. [img]https://cdn.artofproblemsolving.com/attachments/8/e/cc8a435cb28420ccf91340023d440e39f0e849.png[/img]

Ten birds land on a $10$-meter-long wire, each at a random point chosen uniformly along the wire. (That is, if we pick out any $x$-meter portion of the wire, there is an $\tfrac{x}{10}$ probability that a given bird will land there.) What is the probability that every bird sits more than one meter away from its closest neighbor?

A board is called ''Guapo'' if it can be totally covered by pieces equal to that shown in the picture, without gaps and without overlaps or pieces that cover areas outside the board. Is possible to rotate or reflect the pieces. [img]https://imgur.com/o6jX1JO.jpeg[/img] Find all positive integers $n$ such that a board $n \times (n+1)$ is ''Guapo''.

Given $2018$ ones in a row: $$\underbrace{1\,\,\,1\,\,\,1\,\,\,1 \,\,\, ... \,\,\,1 \,\,\,1 \,\,\,1 \,\,\,1}_{2018 \,\,\, ones}$$ in which plus symbols $(+)$ are allowed to be inserted in between the ones. What is the maximum number of plus symbols $(+)$ that need to be inserted so that the resulting sum is 8102?

Let $M$ be a set of $13$ positive integers with the property that $\forall \ m\in M, \ 100\leq m\leq 999$. Prove that there exists a subset $S\subset M$ and a combination of arithmetic operations (addition, subtraction, multiplication, division – without using parentheses) between the elements of $S$, such that the value of the resulting expression is a rational number in the interval $(3,4)$.

In how many different ways can three knights be placed on a chessboard so that the number of squares attacked would be maximal?

A [i]self-avoiding rook walk[/i] on a chessboard (a rectangular grid of unit squares) is a path traced by a sequence of moves parallel to an edge of the board from one unit square to another, such that each begins where the previous move ended and such that no move ever crosses a square that has previously been crossed, i.e., the rook's path is non-self-intersecting. Let $ R(m, n)$ be the number of self-avoiding rook walks on an $ m \times n$ ($ m$ rows, $ n$ columns) chessboard which begin at the lower-left corner and end at the upper-left corner. For example, $ R(m, 1) \equal{} 1$ for all natural numbers $ m$; $ R(2, 2) \equal{} 2$; $ R(3, 2) \equal{} 4$; $ R(3, 3) \equal{} 11$. Find a formula for $ R(3, n)$ for each natural number $ n$.

prove or disprove: in a connected graph $G$, every three longest paths have a vertex in common.

Let $A$ be a set consisting of 6 points in the plane. denoted $n(A)$ as the number of the unit circles which meet at least three points of $A$. Find the maximum of $n(A)$

The main building of ETH Zurich is a rectangle divided into unit squares. Every side of a square is a wall, with certain walls having doors. The outer wall of the main building has no doors. A number of participants of the SMO have gathered in the main building lost. You can only move from one square to another through doors. We have indicates that there is a walkable path between every two squares of the main building. Cyril wants the participants to find each other again by having everyone on the same square leads. To do this, he can give them the following instructions via walkie-talkie: North, East, South or West. After each instruction, each participant simultaneously attempts a square in that direction to go. If there is no door in the corresponding wall, he remains standing. Show that Cyril can reach his goal after a finite number of directions, no matter which one square the participants at the beginning. [hide=original wording]Das Hauptgebäude der ETH Zürich ist ein in Einheitsquadrate unterteiltes Rechteck. Jede Seite eines Quadrates ist eine Wand, wobei gewisse Wände Türen haben. Die Aussenwand des Hauptgebäudes hat keine Türen. Eine Anzahl von Teilnehmern der SMO hat sich im Hauptgebäude verirrt. Sie können sich nur durch Türen von einem Quadrat zum anderen bewegen. Wir nehmen an, dass zwischen je zwei Quadraten des Hauptgebäudes ein begehbarer Weg existiert. Cyril möchte erreichen, dass sich die Teilnehmer wieder nden, indem er alle auf dasselbe Quadrat führt. Dazu kann er ihnen per Walkie-Talkie folgende Anweisungen geben: Nord, Ost, Süd oder West. Nach jeder Anweisung versucht jeder Teilnehmer gleichzeitig, ein Quadrat in diese Richtung zu gehen. Falls in der entsprechenden Wand keine Türe ist, bleibt er stehen. Zeige, dass Cyril sein Ziel nach endlich vielen Anweisungen erreichen kann, egal auf welchen Quadraten sich die Teilnehmer am Anfang benden. [/hide]

Each of $11$ weights is weighing an integer number of grams. No two weights are equal. It is known that if all these weights or any group of them are placed on a balance then the side with a larger number of weights is always heavier. Prove that at least one weight is heavier than $35$ grams.

Let $n$ be a positive integer and let $(a_1,a_2,\ldots ,a_{2n})$ be a permutation of $1,2,\ldots ,2n$ such that the numbers $|a_{i+1}-a_i|$ are pairwise distinct for $i=1,\ldots ,2n-1$. Prove that $\{a_2,a_4,\ldots ,a_{2n}\}=\{1,2,\ldots ,n\}$ if and only if $a_1-a_{2n}=n$.

Let $n$ be a positive integer. Each cell of an $n \times n$ table is coloured in one of $k$ colours where every colour is used at least once. Two different colours $A$ and $B$ are said to touch each other, if there exists a cell coloured in $A$ sharing a side with a cell coloured in $B$. The table is coloured in such a way that each colour touches at most $2$ other colours. What is the maximal value of $k$ in terms of $n$?

The $2001$ towns in a country are connected by some roads, at least one road from each town, so that no town is connected by a road to every other city. We call a set $D$ of towns [i]dominant[/i] if every town not in $D$ is connected by a road to a town in $D$. Suppose that each dominant set consists of at least $k$ towns. Prove that the country can be partitioned into $2001-k$ republics in such a way that no two towns in the same republic are connected by a road.

Every positive integer is either [i]nice [/i] or [i]naughty[/i], and the Oracle of Numbers knows which are which. However, the Oracle will not directly tell you whether a number is [i]nice [/i] or [i]naughty[/i]. The only questions the Oracle will answer are questions of the form “What is the sum of all nice divisors of $n$?,” where $n$ is a number of the questioner’s choice. For instance, suppose ([i]just [/i] for this example) that $2$ and $3$ are nice, while $1$ and $6$ are [i]naughty[/i]. In that case, if you asked the Oracle, “What is the sum of all nice divisors of $6$?,” the Oracle’s answer would be $5$. Show that for any given positive integer $n$ less than $1$ million, you can determine whether $n$ is [i]nice [/i] or [i]naughty [/i] by asking the Oracle at most four questions.

A set of $2003$ positive integers is given. Show that one can find two elements such that their sum is not a divisor of the sum of the other elements.

Let $n\geq 3$ and $A_1,A_2,\ldots,A_n$ be points on a circle. Find the largest number of acute triangles that can be considered with vertices in these points. [i]G. Eckstein[/i]

Let $X$ be a set of $100$ elements. Find the smallest possible $n$ satisfying the following condition: Given a sequence of $n$ subsets of $X$, $A_1,A_2,\ldots,A_n$, there exists $1 \leq i < j < k \leq n$ such that $$A_i \subseteq A_j \subseteq A_k \text{ or } A_i \supseteq A_j \supseteq A_k.$$

Sets $A, B$, and $C$ satisfy $|A| = 92$, $|B| = 35$, $|C| = 63$, $|A\cap B| = 16$, $|A\cap C| = 51$, $|B\cap C| = 19$. Compute the number of possible values of$ |A \cap B \cap C|$.

Suppose that to every point of the plane a colour, either red or blue, is associated. (a) Show that if there is no equilateral triangle with all vertices of the same colour then there must exist three points $A,B$ and $C$ of the same colour such that $B$ is the midpoint of $AC$. (b) Show that there must be an equilateral triangle with all vertices of the same colour.