A $2010\times 2010$ board is divided into corner-shaped figures of three cells. Prove that it is possible to mark one cell in each figure such that each row and each column will have the same number of marked cells. [i]I. Bogdanov & O. Podlipsky[/i]

Pasha and Vova play the following game, making moves in turn; Pasha moves first. Initially, they have a large piece of plasticine. By a move, Pasha cuts one of the existing pieces into three(of arbitrary sizes), and Vova merges two existing pieces into one. Pasha wins if at some point there appear to be $100$ pieces of equal weights. Can Vova prevent Pasha's win?

Find all functions $ f: \mathbb{R} \to \mathbb{R}$ satisfying \[ f\left(\frac {x \plus{} y}{x \minus{} y}\right) \equal{} \frac {f\left(x\right) \plus{} f\left(y\right)}{f\left(x\right) \minus{} f\left(y\right)} \] for all $ x \neq y$.

A house has an even number of lamps distributed among its rooms in such a way that there are at least three lamps in every room. Each lamp shares a switch with exactly one other lamp, not necessarily from the same room. Each change in the switch shared by two lamps changes their states simultaneously. Prove that for every initial state of the lamps there exists a sequence of changes in some of the switches at the end of which each room contains lamps which are on as well as lamps which are off. [i]Proposed by Australia[/i]

Decompose a $5$-dimensional real linear space into the irreducible invariant subspaces of the group generated by cyclic permutations of the basis vectors.

Let $\mathcal{A}$ denote the set of all polynomials in three variables $x, y, z$ with integer coefficients. Let $\mathcal{B}$ denote the subset of $\mathcal{A}$ formed by all polynomials which can be expressed as \begin{align*} (x + y + z)P(x, y, z) + (xy + yz + zx)Q(x, y, z) + xyzR(x, y, z) \end{align*} with $P, Q, R \in \mathcal{A}$. Find the smallest non-negative integer $n$ such that $x^i y^j z^k \in \mathcal{B}$ for all non-negative integers $i, j, k$ satisfying $i + j + k \geq n$.

Consider an isosceles triangle $ABC$ with $AB=AC$, and a circle $\omega$ which is tangent to the sides $AB$ and $AC$ of this triangle and intersects the side $BC$ at the points $K$ and $L$. The segment $AK$ intersects the circle $\omega$ at a point $M$ (apart from $K$). Let $P$ and $Q$ be the reflections of the point $K$ in the points $B$ and $C$, respectively. Show that the circumcircle of triangle $PMQ$ is tangent to the circle $\omega$.

Let $n>1$ be a positive integer. Each cell of an $n\times n$ table contains an integer. Suppose that the following conditions are satisfied: [list=1] [*] Each number in the table is congruent to $1$ modulo $n$. [*] The sum of numbers in any row, as well as the sum of numbers in any column, is congruent to $n$ modulo $n^2$. [/list] Let $R_i$ be the product of the numbers in the $i^{\text{th}}$ row, and $C_j$ be the product of the number in the $j^{\text{th}}$ column. Prove that the sums $R_1+\hdots R_n$ and $C_1+\hdots C_n$ are congruent modulo $n^4$.

Find all linear homogeneous differential equations with continuous coefficients (on the whole real line) such that for any solution $ f(t)$ and any real number $ c,f(t\plus{}c)$ is also a solution.

The alphabet of the tribe AAB consists of the only letters $A$ and $B$. However, if you insert or delete the combination $AAA$ or $BBB$ for any words, the meaning of the word will not change. In addition, if $AB$ is replaced with $BBAA$, or vice versa, the meaning of the word doesn't change. The same holds for $BA$ and $AABB$. Is it true that $AB$ and $BA$ have the same meaning?

Let $n>1 \in \mathbb{N}$ and $a_1, a_2, ..., a_n$ be a sequence of $n$ natural integers. Let: $$b_1 = \left[\frac{a_2 + \cdots + a_n}{n-1}\right], b_i = \left[\frac{a_1 + \cdots + a_{i-1} + a_{i+1} + \cdots + a_n}{n-1}\right], b_n = \left[\frac{a_1 + \cdots + a_{n-1}}{n-1}\right]$$ Define a mapping $f$ by $f(a_1,a_2, \cdots a_n) = (b_1,b_2,\cdots,b_n)$. a) Let $g: \mathbb{N} \to \mathbb{N}$ be a function such that $g(1)$ is the number of different elements in $f(a_1,a_2, \cdots a_n)$ and $g(m)$ is the number od different elements in $f^m(a_1,a_2, \cdots a_n) = f(f^{m-1}(a_1,a_2, \cdots a_n)); m>1$. Prove that $\exists k_0 \in \mathbb{N}$ s.t. for $m \ge k_0$ the function $g(m)$ is periodic. b) Prove that $\sum_{m=1}^k \frac{g(m)}{m(m+1)} < C$ for all $k \in \mathbb{N}$, where $C$ is a function that doesn't depend on $k$.

Let $0\leq p,r\leq 1$ and consider the identities $$a)\; (px+(1-p)y)^{2}=a x^2 +bxy +c y^2, \;\;\;\, b)\; (px+(1-p)y)(rx+(1-r)y) =\alpha x^2 + \beta xy + \gamma y^2.$$ Show that $$ a)\; \max(a,b,c) \geq \frac{4}{9}, \;\;\;\; b)\; \max( \alpha, \beta , \gamma) \geq \frac{4}{9}.$$

Two squares, both with side length $1$, are arranged so that one has one vertex in the center of the other. Determine the area of the gray area. [img]https://1.bp.blogspot.com/-xt3pe0rp1SI/XzcGLgEw1EI/AAAAAAAAMYM/vFKxvvVuLvAJ5FO_yX315X3Fg_iFaK2fACLcBGAsYHQ/s0/1997%2BMohr%2Bp2.png[/img]

To each vertex of a regular pentagon an integer is assigned, so that the sum of all five numbers is positive. If three consecutive vertices are assigned the numbers $x,y,z$ respectively, and $y<0$, then the following operation is allowed: $x,y,z$ are replaced by $x+y,-y,z+y$ respectively. Such an operation is performed repeatedly as long as at least one of the five numbers is negative. Determine whether this procedure necessarily comes to an end after a finite number of steps.