A cake has the form of an $ n$ x $ n$ square composed of $ n^{2}$ unit squares. Strawberries lie on some of the unit squares so that each row or column contains exactly one strawberry; call this arrangement $\mathcal{A}$. Let $\mathcal{B}$ be another such arrangement. Suppose that every grid rectangle with one vertex at the top left corner of the cake contains no fewer strawberries of arrangement $\mathcal{B}$ than of arrangement $\mathcal{A}$. Prove that arrangement $\mathcal{B}$ can be obtained from $ \mathcal{A}$ by performing a number of switches, defined as follows: A switch consists in selecting a grid rectangle with only two strawberries, situated at its top right corner and bottom left corner, and moving these two strawberries to the other two corners of that rectangle.

Let $ p$ be a prime number and let $ 0\leq a_{1}< a_{2}<\cdots < a_{m}< p$ and $ 0\leq b_{1}< b_{2}<\cdots < b_{n}< p$ be arbitrary integers. Let $ k$ be the number of distinct residues modulo $ p$ that $ a_{i}\plus{}b_{j}$ give when $ i$ runs from 1 to $ m$, and $ j$ from 1 to $ n$. Prove that a) if $ m\plus{}n > p$ then $ k \equal{} p$; b) if $ m\plus{}n\leq p$ then $ k\geq m\plus{}n\minus{}1$.

Let $\alpha $ be an angle such that $\cos \alpha = \frac pq$, where $p$ and $q$ are two integers. Prove that the number $q^n \cos n \alpha$ is an integer.

Find all functions $f:\mathbb N\to\mathbb N$ so that $$f^{2f(b)}(2a)=f(f(a+b))+a+b$$ holds for all positive integers $a,b$.

Suppose that $S$ is a subset of $\{1, 2, 3,...,25\}$ such that the sum of any two (not necessarily distinct) elements of $S$ is never an element of $S$. What is the maximum number of elements $S$ may contain? $\textbf{(A) }12 \qquad \textbf{(B) }13 \qquad \textbf{(C) }14 \qquad \textbf{(D) }15 \qquad \textbf{(E) }16$

A $2^{2014} + 1$ by $2^{2014} + 1$ grid has some black squares filled. The filled black squares form one or more snakes on the plane, each of whose heads splits at some points but never comes back together. In other words, for every positive integer $n$ greater than $2$, there do not exist pairwise distinct black squares $s_1$, $s_2$, \dots, $s_n$ such that $s_i$ and $s_{i+1}$ share an edge for $i=1,2, \dots, n$ (here $s_{n+1}=s_1$). What is the maximum possible number of filled black squares? [i]Proposed by David Yang[/i]

Let $a$ be a real number, such that $a\ne 0, a\ne 1, a\ne -1$ and $m,n,p,q$ be natural numbers . Prove that if $a^m+a^n=a^p+a^q$ and $a^{3m}+a^{3n}=a^{3p}+a^{3q}$ , then $m \cdot n = p \cdot q$.

There are $n$ students. Denoted the number of the selections to select two students (with their weights are $a$ and $b$) such that $\left| {a - b} \right| \le 1$ (kg) and $\left| {a - b} \right| \le 2$ (kg) by $A_1$ and $A_2$, respectively. Prove that $A_2<3A_1+n$.

Let $n$ be a positive integer. Find the number of permutations $a_1$, $a_2$, $\dots a_n$ of the sequence $1$, $2$, $\dots$ , $n$ satisfying $$a_1 \le 2a_2\le 3a_3 \le \dots \le na_n$$. Proposed by United Kingdom

Zeroes and ones are arranged in all the squares of $n\times n$ table. All the squares of the left column are filled by ones, and the sum of numbers in every figure of the form [asy]size(50); draw((2,1)--(0,1)--(0,2)--(2,2)--(2,0)--(1,0)--(1,2));[/asy] (consisting of a square and its neighbours from left and from below) is even. Prove that no two rows of the table are identical. [i]Proposed by O. Vanyushina[/i]

Given 365 cards, in which distinct numbers are written. We may ask for any three cards, the order of numbers written in them. Is it always possible to find out the order of all 365 cards by 2000 such questions?

A magician has one hundred cards numbered 1 to 100. He puts them into three boxes, a red one, a white one and a blue one, so that each box contains at least one card. A member of the audience draws two cards from two different boxes and announces the sum of numbers on those cards. Given this information, the magician locates the box from which no card has been drawn. How many ways are there to put the cards in the three boxes so that the trick works?

Find all functions $f : \mathbb R \to \mathbb R$ such that the equality \[y^2f(x) + x^2f(y) + xy = xyf(x + y) + x^2 + y^2\] holds for all $x, y \in \Bbb R$, where $\Bbb R$ is the set of real numbers.

Find all positive integers $n$ for which all positive divisors of $n$ can be put into the cells of a rectangular table under the following constraints: [list] [*]each cell contains a distinct divisor; [*]the sums of all rows are equal; and [*]the sums of all columns are equal. [/list]