$d(n)$ shows the number of positive integer divisors of positive integer $n$. For which positive integers $n$ one cannot find a positive integer $k$ such that $\underbrace{d(\dots d(d}_{k\ \text{times}} (n) \dots )$ is a perfect square.

Given that $a_1, a_2, \ldots,a_{2020}$ are integers, find the maximal number of subsequences $a_i,a_{i+1}, ..., a_j$ ($0<i\leq j<2021$) with with sum $2021$

Koshchey opened an account at the bank. Initially, it had 0 rubles. On the first day, Koshchey puts $k>0$ rubles in, and every next day adds one ruble more there than the day before. Each time after Koshchey deposits money into the account, the total amount in the account is divided by two by the bank. Find all such $k{}$ for which the amount on the account will always be an integer number of rubles. [i]Proposed by S. Berlov[/i]

Let $n \geq 2$ be an integer. Lucia chooses $n$ real numbers $x_1,x_2,\ldots,x_n$ such that $\left| x_i-x_j \right|\geq 1$ for all $i\neq j$. Then, in each cell of an $n \times n$ grid, she writes one of these numbers, in such a way that no number is repeated in the same row or column. Finally, for each cell, she calculates the absolute value of the difference between the number in the cell and the number in the first cell of its same row. Determine the smallest value that the sum of the $n^2$ numbers that Lucia calculated can take.

Consider a directed graph $G$ with $n$ vertices, where $1$-cycles and $2$-cycles are permitted. For any set $S$ of vertices, let $N^{+}(S)$ denote the out-neighborhood of $S$ (i.e. set of successors of $S$), and define $(N^{+})^k(S)=N^{+}((N^{+})^{k-1}(S))$ for $k\ge2$. For fixed $n$, let $f(n)$ denote the maximum possible number of distinct sets of vertices in $\{(N^{+})^k(X)\}_{k=1}^{\infty}$, where $X$ is some subset of $V(G)$. Show that there exists $n>2012$ such that $f(n)<1.0001^n$. [i]Linus Hamilton.[/i]

Let $x_1,...,x_n$ be positive real numbers, satisfying $x_1+\dots+x_n=n$. Prove that $\frac{x_1}{x_2}+\frac{x_2}{x_3}+\dots+\frac{x_{n-1}}{x_n}+\frac{x_n}{x_1}\leq\frac{4}{x_1\cdot x_2\cdot\dots\cdot x_n}+n-4$.

Define a $ k$-[i]clique[/i] to be a set of $ k$ people such that every pair of them are acquainted with each other. At a certain party, every pair of 3-cliques has at least one person in common, and there are no 5-cliques. Prove that there are two or fewer people at the party whose departure leaves no 3-clique remaining.

Prove the inequality [b]a.)[/b] $ \left( a_{1}+a_{2}+...+a_{k}\right) ^{2}\leq k\left( a_{1}^{2}+a_{2}^{2}+...+a_{k}^{2}\right) , $ where $k\geq 1$ is a natural number and $a_{1},$ $a_{2},$ $...,$ $a_{k}$ are arbitrary real numbers. [b]b.)[/b] Using the inequality (1), show that if the real numbers $a_{1},$ $a_{2},$ $...,$ $a_{n}$ satisfy the inequality \[ a_{1}+a_{2}+...+a_{n}\geq \sqrt{\left( n-1\right) \left( a_{1}^{2}+a_{2}^{2}+...+a_{n}^{2}\right) }, \] then all of these numbers $a_{1},$ $a_{2},$ $\ldots,$ $a_{n}$ are non-negative.

For any integer $k\ge1$, let $p(k)$ be the smallest prime which does not divide $k$. Define the integer function $X(k)$ to be the product of all primes less than $p(k)$ if $p(k)>2$, and $X(k)=1$ if $p(k)=2$. Let $\{x_n\}$ be the sequence defined by $x_0=1$, and $x_{n+1}X(x_n)=x_np(x_n)$ for $n\ge0$. Find the smallest positive integer, $t$ such that $x_t=2090$.

A king decides to reward one of his knights by making a game. He sits the knights at a round table and has them call out $1,2,3,1,2,3,\dots$ around the circle (that is, clockwise, and each person says a number). The people who say $2$ or $3$ immediately lose, and this continues until the last knight is left, the winner. Numbering the knights initially as $1,2,\dots,n$, find all values of $n$ such that knight $2008$ is the winner.

Let $k$ and $d$ be positive integers. Prove that there exists a positive integer $N$ such that for every odd integer $n>N$, the digits in the base-$2n$ representation of $n^k$ are all greater than $d$.

Let $P_1, \ldots , P_s$ be arithmetic progressions of integers, the following conditions being satisfied: [b](i)[/b] each integer belongs to at least one of them; [b](ii)[/b] each progression contains a number which does not belong to other progressions. Denote by $n$ the least common multiple of the ratios of these progressions; let $n=p_1^{\alpha_1} \cdots p_k^{\alpha_k}$ its prime factorization. Prove that \[s \geq 1 + \sum^k_{i=1} \alpha_i (p_i - 1).\] [i]Proposed by Dierk Schleicher, Germany[/i]

Consider a checkered $3m\times 3m$ square, where $m$ is an integer greater than $1.$ A frog sits on the lower left corner cell $S$ and wants to get to the upper right corner cell $F.$ The frog can hop from any cell to either the next cell to the right or the next cell upwards. Some cells can be [i]sticky[/i], and the frog gets trapped once it hops on such a cell. A set $X$ of cells is called [i]blocking[/i] if the frog cannot reach $F$ from $S$ when all the cells of $X$ are sticky. A blocking set is [i] minimal[/i] if it does not contain a smaller blocking set.[list=a][*]Prove that there exists a minimal blocking set containing at least $3m^2-3m$ cells. [*]Prove that every minimal blocking set containing at most $3m^2$ cells.

Ten cars are moving at the road. There are some cities at the road. Each car is moving with some constant speed through cities and with some different constant speed outside the cities (different cars may move with different speed). There are 2011 points at the road. Cars don't overtake at the points. Prove that there are 2 points such that cars pass through these points in the same order. [i]S. Berlov[/i]

Consider a directed graph $G$ with $n$ vertices, where $1$-cycles and $2$-cycles are permitted. For any set $S$ of vertices, let $N^{+}(S)$ denote the out-neighborhood of $S$ (i.e. set of successors of $S$), and define $(N^{+})^k(S)=N^{+}((N^{+})^{k-1}(S))$ for $k\ge2$. For fixed $n$, let $f(n)$ denote the maximum possible number of distinct sets of vertices in $\{(N^{+})^k(X)\}_{k=1}^{\infty}$, where $X$ is some subset of $V(G)$. Show that there exists $n>2012$ such that $f(n)<1.0001^n$. [i]Linus Hamilton.[/i]