In any cell of an $n \times n$ table a number is written such that all the rows are distinct. Prove that we can remove a column such that the rows in the new table are still distinct.

Let $a_1, b_1, a_2, b_2, \dots , a_n, b_n$ be nonnegative real numbers. Prove that \[ \sum_{i, j = 1}^{n} \min\{a_ia_j, b_ib_j\} \le \sum_{i, j = 1}^{n} \min\{a_ib_j, a_jb_i\}. \]

$5000$ movie fans gathered at a convention. Each participant had watched at least one movie. The participants should be split into discussion groups of two kinds. In each group of the first kind, the members would discuss a movie they all watched. In each group of the second kind, each member would tell about the movie that no one else in this group had watched. Prove that the chairman can always split the participants into exactly 100 groups. (A group consisting of one person is allowed; in this case this person submits a report).

Ben has a big blackboard, initially empty, and Francisco has a fair coin. Francisco flips the coin $2013$ times. On the $n^{\text{th}}$ flip (where $n=1,2,\dots,2013$), Ben does the following if the coin flips heads: (i) If the blackboard is empty, Ben writes $n$ on the blackboard. (ii) If the blackboard is not empty, let $m$ denote the largest number on the blackboard. If $m^2+2n^2$ is divisible by $3$, Ben erases $m$ from the blackboard; otherwise, he writes the number $n$. No action is taken when the coin flips tails. If probability that the blackboard is empty after all $2013$ flips is $\frac{2u+1}{2^k(2v+1)}$, where $u$, $v$, and $k$ are nonnegative integers, compute $k$. [i]Proposed by Evan Chen[/i]

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

Define \[\begin{cases}d(n, 0)=d(n, n)=1&(n \ge 0),\\ md(n, m)=md(n-1, m)+(2n-m)d(n-1,m-1)&(0<m<n).\end{cases}\] Prove that $d(n, m)$ are integers for all $m, n \in \mathbb{N}$.

Two numbers are written on each vertex of a convex $100$-gon. Prove that it is possible to remove a number from each vertex so that the remaining numbers on any two adjacent vertices are different. [i]F. Petrov [/i]