Let $ T$ denote the set of all ordered triples $ (p,q,r)$ of nonnegative integers. Find all functions $ f: T \rightarrow \mathbb{R}$ satisfying \[ f(p,q,r) = \begin{cases} 0 & \text{if} \; pqr = 0, \\ 1 + \frac{1}{6}(f(p + 1,q - 1,r) + f(p - 1,q + 1,r) & \\ + f(p - 1,q,r + 1) + f(p + 1,q,r - 1) & \\ + f(p,q + 1,r - 1) + f(p,q - 1,r + 1)) & \text{otherwise} \end{cases} \] for all nonnegative integers $ p$, $ q$, $ r$.

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$.

For positive integers $a$ and $b$, an $(a,b)$-shuffle of a deck of $a+b$ cards is any shuffle that preserves the relative order of the top $a$ cards and the relative order of the bottom $b$ cards. Let $n$, $k$, $a_1$, $a_2$, $\dots$, $a_k$, $b_1$, $b_2$, $\dots$, $b_k$ be fixed positive integers such that $a_i+b_i=n$ for all $1\leq i\leq k$. Big Bird has a deck of $n$ cards and will perform an $(a_i,b_i)$-shuffle for each $1\leq i\leq k$, in ascending order of $i$. Suppose that Big Bird can reverse the order of the deck. Prove that Big Bird can also achieve any of the $n!$ permutations of the cards. [i]Linus Tang[/i]

On the cartesian plane are drawn several rectangles with the sides parallel to the coordinate axes. Assume that any two rectangles can be cut by a vertical or a horizontal line. Show that it's possible to draw one horizontal and one vertical line such that each rectangle is cut by at least one of these two lines.

A sequence of real numbers $a_1,a_2,\ldots$ satisfies the relation $$a_n=-\max_{i+j=n}(a_i+a_j)\qquad\text{for all}\quad n>2017.$$ Prove that the sequence is bounded, i.e., there is a constant $M$ such that $|a_n|\leq M$ for all positive integers $n$.

Let $n$ be a positive integer. Let $S$ be the set of $n^2$ cells in an $n\times n$ grid. Call a subset $T$ of $S$ a [b]double staircase [/b] if [list] [*] $T$ can be partitioned into $n$ horizontal nonoverlapping rectangles of dimensions $1 \times 1, 1 \times 2, ..., 1 \times n,$ and [*]$T$ can also be partitioned into $n$ vertical nonoverlapping rectangles of dimensions $1\times1, 2 \times 1, ..., n \times 1$. [/list] In terms of $n$, how many double staircases are there? (Rotations and reflections are considered distinct.) An example of a double staircase when $n = 3$ is shown below. [asy] unitsize(1cm); for (int i = 0; i <= 3; ++i) { draw((0,i)--(3,i),linewidth(0.2)); draw((i,0)--(i,3),linewidth(0.2)); } filldraw((0,0)--(1,0)--(1,1)--(0,1)--cycle, lightgray, linewidth(0.2)); filldraw((1,0)--(2,0)--(2,1)--(1,1)--cycle, lightgray, linewidth(0.2)); filldraw((2,0)--(3,0)--(3,1)--(2,1)--cycle, lightgray, linewidth(0.2)); filldraw((0,1)--(1,1)--(1,2)--(0,2)--cycle, lightgray, linewidth(0.2)); filldraw((1,1)--(2,1)--(2,2)--(1,2)--cycle, lightgray, linewidth(0.2)); filldraw((1,2)--(2,2)--(2,3)--(1,3)--cycle, lightgray, linewidth(0.2)); [/asy]

$n$ people attend a party. There are no more than $n$ pairs of friends among them. Two people shake hands if and only if they have at least $1$ common friend. Given integer $m\ge 3$ such that $n\leq m^3$. Prove that there exists a person $A$, the number of people that shake hands with $A$ is no more than $m-1$ times of the number of $A$‘S friends.

Let $x_0,x_1,x_2,\dots$ be the sequence such that $x_0=1$ and for $n\ge 0,$ \[x_{n+1}=\ln(e^{x_n}-x_n)\] (as usual, the function $\ln$ is the natural logarithm). Show that the infinite series \[x_0+x_1+x_2+\cdots\] converges and find its sum.

For each prime $p$, construct a graph $G_p$ on $\{1,2,\ldots p\}$, where $m\neq n$ are adjacent if and only if $p$ divides $(m^{2} + 1-n)(n^{2} + 1-m)$. Prove that $G_p$ is disconnected for infinitely many $p$

Consider the following sequence: $a_1 = 1$, $a_2 = 2$, $a_3 = 3$, and \[a_{n+3} = \frac{a_{n+1}^2 + a_{n+2}^2 - 2}{a_n}\] for all integers $n \ge 1$. Prove that every term of the sequence is a positive integer.

For each pair of positive integers $(x, y)$ a nonnegative integer $x\Delta y$ is defined. It is known that for all positive integers $a$ and $b$ the following equalities hold: i. $(a + b)\Delta b = a\Delta b + 1$. ii. $(a\Delta b) \cdot (b\Delta a) = 0$. Find the values of the expressions $2016\Delta 121$ and $2016\Delta 144$.

Find all functions $ f: \mathbb R\longrightarrow \mathbb R$ such that for each $ x,y\in\mathbb R$: \[ f(xf(y)) \plus{} y \plus{} f(x) \equal{} f(x \plus{} f(y)) \plus{} yf(x)\]

For an integer $n \geq 3$ we define the sequence $\alpha_1, \alpha_2, \ldots, \alpha_k$ as the sequence of exponents in the prime factorization of $n! = p_1^{\alpha_1}p_2^{\alpha_2} \ldots p_k^{\alpha_k}$, where $p_1 < p_2 < \ldots < p_k$ are primes. Determine all integers $n \geq 3$ for which $\alpha_1, \alpha_2, \ldots, \alpha_k$ is a geometric progression.

Do there exist $2011$ positive integers $a_1 < a_2 < \ldots < a_{2011}$ such that $\gcd(a_i,a_j) = a_j - a_i$ for any $i$, $j$ such that $1 \le i < j \le 2011$?

Prove that for any polynomial $P$ with real coefficients, and for any positive integer $n$, there exists a polynomial $Q$ with real coefficients such that $P(x)^2 +Q(x)^2$ is divisible by $(1+x^2)^n$.