Let $n \ge 3$ be a fixed integer. A game is played by $n$ players sitting in a circle. Initially, each player draws three cards from a shuffled deck of $3n$ cards numbered $1, 2, \dots, 3n$. Then, on each turn, every player simultaneously passes the smallest-numbered card in their hand one place clockwise and the largest-numbered card in their hand one place counterclockwise, while keeping the middle card. Let $T_r$ denote the configuration after $r$ turns (so $T_0$ is the initial configuration). Show that $T_r$ is eventually periodic with period $n$, and find the smallest integer $m$ for which, regardless of the initial configuration, $T_m=T_{m+n}$. [i]Proposed by Carl Schildkraut and Colin Tang[/i]

Let $n\ge2$ be a positive integer. Given a sequence $\left(s_i\right)$ of $n$ distinct real numbers, define the "class" of the sequence to be the sequence $\left(a_1,a_2,\ldots,a_{n-1}\right)$, where $a_i$ is $1$ if $s_{i+1} > s_i$ and $-1$ otherwise. Find the smallest integer $m$ such that there exists a sequence $\left(w_i\right)$ of length $m$ such that for every possible class of a sequence of length $n$, there is a subsequence of $\left(w_i\right)$ that has that class. [i]David Yang.[/i]

A council has $6$ members and decisions are based on agreeing and disagreeing votes. We call a decision making method an [b]Acceptable way to decide[/b] if it satisfies the two following conditions: [b]Ascending condition[/b]: If in some case, the final result is positive, it also stays positive if some one changes their disagreeing vote to agreeing vote. [b]Symmetry condition[/b]: If all members change their votes, the result will also change. [b] Weighted Voting[/b] for example, is an [b]Acceptable way to decide[/b]. In which members are allotted with non-negative weights like $\omega_1,\omega_2,\cdots , \omega_6$ and the final decision is made with comparing the weight sum of the votes for, and the votes against. For instance if $\omega_1=2$ and for all $i\ge2, \omega_i=1$, decision is based on the majority of the votes, and in case when votes are equal, the vote of the first member will be the decider. Give an example of some [b]Acceptable way to decide[/b] method that cannot be represented as a [b]Weighted Voting[/b] method.

Alice and Bob are playing a year number game. There will be two game numbers $19$ and $20$ and one starting number from the set $\{9, 10\}$ used. Alice chooses independently her game number and Bob chooses the starting number. The other number is given to Bob. Then Alice adds her game number to the starting number, Bob adds his game number to the result, Alice adds her number of games to the result, etc. The game continues until the number $2019$ is reached or exceeded. Whoever reaches the number $2019$ wins. If $2019$ is exceeded, the game ends in a draw. $\bullet$ Show that Bob cannot win. $\bullet$ What starting number does Bob have to choose to prevent Alice from winning? (Richard Henner)

Find the maximum number of increasing arithmetic progressions that can have a finite sequence of real numbers $a_1<a_2<\cdots<a_n$ of $n\ge 3$ real numbers.

Let $d$ be a positive real number. The scorpion tries to catch the flea on a $10\times 10$ chessboard. The length of the side of each small square of the chessboard is $1$. In this game, the flea and the scorpion move alternately. The flea is always on one of the $121$ vertexes of the chessboard and, in each turn, can jump from the vertex where it is to one of the adjacent vertexes. The scorpion moves on the boundary line of the chessboard, and, in each turn, it can walk along any path of length less than $d$. At the beginning, the flea is at the center of the chessboard and the scorpion is at a point that he chooses on the boundary line. The flea is the first one to play. The flea is said to [i]escape[/i] if it reaches a point of the boundary line, which the scorpion can't reach in the next turn. Obviously, for big values of $d$, the scorpion has a strategy to prevent the flea's escape. For what values of $d$ can the flea escape? Justify your answer.

Let $K$ and $L$ be positive integers. On a board consisting of $2K \times 2L$ unit squares an ant starts in the lower left corner square and walks to the upper right corner square. In each step it goes horizontally or vertically to a neighbouring square. It never visits a square twice. At the end some squares may remain unvisited. In some cases the collection of all unvisited squares forms a single rectangle. In such cases, we call this rectangle [i]MEMOrable[/i]. Determine the number of different MEMOrable rectangles. [i]Remark: Rectangles are different unless they consist of exactly the same squares.[/i]

Each point in the plane with integer coordinates is colored red or blue such that the following two properties hold. For any two red points, the line segment joining them does not contain any blue points. For any two blue points that are distance $2$ apart, the midpoint of the line segment joining them is blue. Prove that if three red points are the vertices of a triangle, then the interior of the triangle does not contain any blue points.

A checkered table consists of $2012$ rows and $k > 2$ columns. A marker is placed in a cell of the left-most column. Two players move the marker in turns. During each move, the player moves the marker by $1$ cell to the right, up or down to a cell that had never been occupied by the marker before. The game is over when any of the players moves the marker to the right-most column. However, whether this player is to win or to lose, the players are advised only when the marker reaches the second column from the right. Can any player secure his win?

A function $f: \mathbb{R}\to \mathbb{R}$ is [i]essentially increasing[/i] if $f(s)\leq f(t)$ holds whenever $s\leq t$ are real numbers such that $f(s)\neq 0$ and $f(t)\neq 0$. Find the smallest integer $k$ such that for any 2022 real numbers $x_1,x_2,\ldots , x_{2022},$ there exist $k$ essentially increasing functions $f_1,\ldots, f_k$ such that \[f_1(n) + f_2(n) + \cdots + f_k(n) = x_n\qquad \text{for every } n= 1,2,\ldots 2022.\]

What maximum number of elements can be selected from the set $\{1, 2, 3, \dots, 100\}$ so that [b]no[/b] sum of any three selected numbers is equal to a selected number? [i]Proposed by A. Golovanov[/i]

Given a cube, a cubic box, that exactly suits for the cube, and six colours. First man paints each side of the cube with its (side's) unique colour. Another man does the same with the box. Prove that the third man can put the cube in the box in such a way, that every cube side will touch the box side of different colour.

$25$ boys and $25$ girls sit around a table. Show that there is a person who has a girl sitting on either side of them.

50 knights of King Arthur sat at the Round Table. A glass of white or red wine stood before each of them. It is known that at least one glass of red wine and at least one glass of white wine stood on the table. The king clapped his hands twice. After the first clap every knight with a glass of red wine before him took a glass from his left neighbour. After the second clap every knight with a glass of white wine (and possibly something more) before him gave this glass to the left neughbour of his left neighbour. Prove that some knight was left without wine. [i]Proposed by A. Khrabrov, incorrect translation from Hungarian[/i]

Initially, each unit square of an $n \times n$ grid is colored red, yellow or blue. In each round, perform the following operation for every unit square simultaneously: [list] [*] For a red square, if there is a yellow square that has a common edge with it, then color it yellow. [*] For a yellow square, if there is a blue square that has a common edge with it, then color it blue. [*] For a blue square, if there is a red square that has a common edge with it, then color it red. [/list] It is known that after several rounds, all unit squares of this $n \times n$ grid have the same color. Prove that the grid has became monochromatic no later than the end of the $(2n-2)$-th round.

[b]p10.[/b] Square $ABCD$ has side length $n > 1$. Points $E$ and $F$ lie on $\overline{AB}$ and $\overline{BC}$ such that $AE = BF = 1$. Suppose $\overline{DE}$ and $\overline{AF}$ intersect at $X$ and $\frac{AX}{XF} = \frac{11}{111}$ . What is $n$? [b]p11.[/b] Let $x$ be the positive root of $x^2 - 10x - 10 = 0$. Compute $\frac{1}{20}x^4 - 6x^2 - 45$. [b]p12.[/b] Francesca has $7$ identical marbles and $5$ distinctly labeled pots. How many ways are there for her to distribute at least one (but not necessarily all) of the marbles into the pots such that at most two pots are nonempty? PS. You should use hide for answers.

Each of $n$ black squares and $n$ white squares can be obtained by a translation from each other. Every two squares of different colours have a common point. Prove that ther is a point belonging at least to $n$ squares. [i](V. Dolnikov)[/i]

In the unit squares of a transparent $1 \times 100$ tape, numbers $1,2,\cdots,100$ are written in the ascending order.We fold this tape on it's lines with arbitrary order and arbitrary directions until we reach a $1 \times1$ tape with $100$ layers.A permutation of the numbers $1,2,\cdots,100$ can be seen on the tape, from the top to the bottom. Prove that the number of possible permutations is between $2^{100}$ and $4^{100}$. ([i]e.g.[/i] We can produce all permutations of numbers $1,2,3$ with a $1\times3$ tape) [i]Proposed by Morteza Saghafian[/i]

Zeros and ones are placed in each square of a rectangular board. Such a board is said to be [i]varied[/i] if each row contains at least one $0$ and at least two $1$s. Given n$\geq 3,$ find all integers $k>1$ with the following property: The columns of each varied board of $k$ rows and n columns can be permuted so that in each row of the new board the $1$s do not form a block (that is, there are at least two $1$s that are separated by one or more $0$s).

There are $2n$ points on the plane. No three of them lie on the same straight line and no four lie on the same circle. Prove that it is possible to split these points into $n$ pairs and cover each pair of points with a circle containing no other points.

Six ducklings swim on the surface of a pond, which is in the shape of a circle with radius $5$ m. Show that at every moment, two of the ducklings swim on the distance of at most $5$ m from each other.

We have $n$ integers $a_1, a_2,. . . , a_n$, not necessarily distinct, with sum $2S.$ An integer $k$ is called [i]separator[/i] if $k$ of the numbers can be chosen with sum equal to $S.$ What is the maximum possible number of separators?

Let $n>1$ be an integer and $S_n$ the set of all permutations $\pi : \{1,2,\cdots,n \} \to \{1,2,\cdots,n \}$ where $\pi$ is bijective function. For every permutation $\pi \in S_n$ we define: \[ F(\pi)= \sum_{k=1}^n |k-\pi(k)| \ \ \text{and} \ \ M_{n}=\frac{1}{n!}\sum_{\pi \in S_n} F(\pi) \] where $M_n$ is taken with all permutations $\pi \in S_n$. Calculate the sum $M_n$.

On an $8 \times 8$ chessboard, $17$ cells are marked. Prove that one can always choose two cells among the marked ones so that a Knight will need at least three moves to go from one of the chosen cells to the other. (R Zhenodarov)

Call a convex polyhedron a [i]footballoid [/i] if it has the following properties. (1) Any face is either a regular pentagon or a regular hexagon. (2) All neighbours of a pentagonal face are hexagonal (a [i]neighbour [/i] of a face is a face that has a common edge with it). Find all possibilities for the number of pentagonal and hexagonal faces of a footballoid.