A pile of cards, numbered with $1$, $2$, ..., $n$, is being shuffled. Afterwards, the following operation is repeatedly performed: If the uppermost card of the pile has the number $k$, then we reverse the order of the $k$ uppermost cards. Prove that, after finitely many executions of this operation, the card with the number $1$ will become the uppermost card of the pile.

Let $n\geqslant 1$ be an integer, and let $x_0,x_1,\ldots,x_{n+1}$ be $n+2$ non-negative real numbers that satisfy $x_ix_{i+1}-x_{i-1}^2\geqslant 1$ for all $i=1,2,\ldots,n.$ Show that \[x_0+x_1+\cdots+x_n+x_{n+1}>\bigg(\frac{2n}{3}\bigg)^{3/2}.\][i]Pakawut Jiradilok and Wijit Yangjit, Thailand[/i]

Let $n \geq 1$ be an integer. A [b]path[/b] from $(0,0)$ to $(n,n)$ in the $xy$ plane is a chain of consecutive unit moves either to the right (move denoted by $E$) or upwards (move denoted by $N$), all the moves being made inside the half-plane $x \geq y$. A [b]step[/b] in a path is the occurence of two consecutive moves of the form $EN$. Show that the number of paths from $(0,0)$ to $(n,n)$ that contain exactly $s$ steps $(n \geq s \geq 1)$ is \[\frac{1}{s} \binom{n-1}{s-1} \binom{n}{s-1}.\]

Find all functions $f : \mathbb N \to \mathbb N$ such that: i) $f^{2000}(m)=f(m)$ for all $m \in \mathbb N$, ii) $f(mn)=\dfrac{f(m)f(n)}{f(\gcd(m,n))}$, for all $m,n\in \mathbb N$, and iii) $f(m)=1$ if and only if $m=1$.

Let $f(x) = x-\tfrac1{x}$, and define $f^1(x) = f(x)$ and $f^n(x) = f(f^{n-1}(x))$ for $n\ge2$. For each $n$, there is a minimal degree $d_n$ such that there exist polynomials $p$ and $q$ with $f^n(x) = \tfrac{p(x)}{q(x)}$ and the degree of $q$ is equal to $d_n$. Find $d_n$.

Find all functions $f: \mathbb{Z}\rightarrow\mathbb{Z}$ such that for all $x,y \in \mathbb{Z}$: \[f(x-y+f(y))=f(x)+f(y).\]

A grasshopper starts at the origin in the coordinate plane and makes a sequence of hops. Each hop has length $5$, and after each hop the grasshopper is at a point whose coordinates are both integers; thus, there are $12$ possible locations for the grasshopper after the first hop. What is the smallest number of hops needed for the grasshopper to reach the point $(2021,2021)$?

Let $ k$ be an integer, $ k \geq 2$, and let $ p_{1},\ p_{2},\ \ldots,\ p_{k}$ be positive reals with $ p_{1} \plus{} p_{2} \plus{} \ldots \plus{} p_{k} \equal{} 1$. Suppose we have a collection $ \left(A_{1,1},\ A_{1,2},\ \ldots,\ A_{1,k}\right)$, $ \left(A_{2,1},\ A_{2,2},\ \ldots,\ A_{2,k}\right)$, $ \ldots$, $ \left(A_{m,1},\ A_{1,2},\ \ldots,\ A_{m,k}\right)$ of $ k$-tuples of finite sets satisfying the following two properties: (i) for every $ i$ and every $ j \neq j^{\prime}$, $ A_{i,j}\cap A_{i,j^{\prime}} \equal{} \emptyset$, and (ii) for every $ i\neq i^{\prime}$ there exist $ j\neq j^{\prime}$ for which $ A_{i,j} \cap A_{i^{\prime},j^{\prime}}\neq\emptyset$. Prove that \[ \sum_{b \equal{} 1}^{m}{\prod_{a \equal{} 1}^{k}{p_{a}^{|A_{b,a}|}}} \leq 1. \]

Suppose a $m \times n$ table. We write an integer in each cell of the table. In each move, we chose a column, a row, or a diagonal (diagonal is the set of cells which the difference between their row number and their column number is constant) and add either $+1$ or $-1$ to all of its cells. Prove that if for all arbitrary $3 \times 3$ table we can change all numbers to zero, then we can change all numbers of $m \times n$ table to zero. ([i]Hint[/i]: First of all think about it how we can change number of $ 3 \times 3$ table to zero.)

Let $n>100$ be a positive integer and originally the number $1$ is written on the blackboard. Petya and Vasya play the following game: every minute Petya represents the number of the board as a sum of two distinct positive fractions with coprime nominator and denominator and Vasya chooses which one to delete. Show that Petya can play in such a manner, that after $n$ moves, the denominator of the fraction left on the board is at most $2^n+50$, no matter how Vasya acts.

Find the least positive integer $n$ such that \[ \frac 1{\sin 45^\circ\sin 46^\circ}+\frac 1{\sin 47^\circ\sin 48^\circ}+\cdots+\frac 1{\sin 133^\circ\sin 134^\circ}=\frac 1{\sin n^\circ}. \]

Consider the numbers $ a_n=1-\binom{n}{3} +\binom{n}{6} -\cdots, b_n= -\binom{n}{1} +\binom{n}{4}-\binom{n}{7} +\cdots $ and $ c_n=\binom{n}{2} -\binom{n}{5} +\binom{n}{8} -\cdots , $ for a natural number $ n\ge 2. $ Prove that $$ a_n^2+b_n^2+c_n^2-a_nb_n-b_nc_n-c_na_n =3^{n-1}. $$

Find the number of strictly increasing sequences of nonnegative integers with the following properties: • The first term is $0$ and the last term is $12$. In particular, the sequence has at least two terms. • Among any two consecutive terms, exactly one of them is even.

Consider infinite sequences $a_1,a_2,\dots$ of positive integers satisfying $a_1=1$ and $$a_n \mid a_k+a_{k+1}+\dots+a_{k+n-1}$$ for all positive integers $k$ and $n.$ For a given positive integer $m,$ find the maximum possible value of $a_{2m}.$ [i]Proposed by Krit Boonsiriseth[/i]

Determine the maximal length $L$ of a sequence $a_1,\dots,a_L$ of positive integers satisfying both the following properties: [list=disc] [*]every term in the sequence is less than or equal to $2^{2023}$, and [*]there does not exist a consecutive subsequence $a_i,a_{i+1},\dots,a_j$ (where $1\le i\le j\le L$) with a choice of signs $s_i,s_{i+1},\dots,s_j\in\{1,-1\}$ for which \[s_ia_i+s_{i+1}a_{i+1}+\dots+s_ja_j=0.\] [/list]