On blackboard is written $3$ digit number so all three digits are distinct than zero. Out of it, we made three $2$ digit numbers by crossing out first digit of original number, crossing out second digit of original number and crossing out third digit of original number. Sum of those three numbers is $293$. Which number is written on blackboard?

Find all real numbers $a$ such that there exist $f:\mathbb{R} \to \mathbb{R}$ with $$f(x-f(y))=f(x)+a[y]$$ for all $x,y\in \mathbb{R}$

How many interger tuples $(x,y,z)$ are there satisfying $0\leq x,y,z < 2011$, $xy+yz+zx \equiv 0 \pmod{2011}$, and $x+y+z \equiv 0 \pmod{2011}$ ? $\textbf{(A)}\ 2010 \qquad\textbf{(B)}\ 2011 \qquad\textbf{(C)}\ 2012 \qquad\textbf{(D)}\ 4021 \qquad\textbf{(E)}\ 4023$

Let $n>1$ be an integer. Given a simple graph $G$ on $n$ vertices $v_1, v_2, \dots, v_n$ we let $k(G)$ be the minimal value of $k$ for which there exist $n$ $k$-dimensional rectangular boxes $R_1, R_2, \dots, R_n$ in a $k$-dimensional coordinate system with edges parallel to the axes, so that for each $1\leq i<j\leq n$, $R_i$ and $R_j$ intersect if and only if there is an edge between $v_i$ and $v_j$ in $G$. Define $M$ to be the maximal value of $k(G)$ over all graphs on $n$ vertices. Calculate $M$ as a function of $n$.

There are $n \geq 3$ islands in a city. Initially, the ferry company offers some routes between some pairs of islands so that it is impossible to divide the islands into two groups such that no two islands in different groups are connected by a ferry route. After each year, the ferry company will close a ferry route between some two islands $X$ and $Y$. At the same time, in order to maintain its service, the company will open new routes according to the following rule: for any island which is connected to a ferry route to exactly one of $X$ and $Y$, a new route between this island and the other of $X$ and $Y$ is added. Suppose at any moment, if we partition all islands into two nonempty groups in any way, then it is known that the ferry company will close a certain route connecting two islands from the two groups after some years. Prove that after some years there will be an island which is connected to all other islands by ferry routes.

The circles $\omega$ and $\Omega$ touch each other internally at $A{}$. In a larger circle $\Omega$ consider the chord $CD$ which touches $\omega$ at $B{}$. It is known that the chord $AB$ is not a diameter of $\omega$. The point $M{}$ is the middle of the segment $AB{}$. Prove that the circumcircle of the triangle $CMD$ passes through the center of $\omega$. [i]Proposed by P. Bibikov[/i]

In the regular hexagon $ABCDEF$, a point $X$ was marked on the diagonal $AD$ such that $\angle AEX = 65^\circ$. What is the degree measure of the angle $\angle XCD$? [i]A.V.Smirnov, I.A.Efremov[/i]

Let $a_1, a_2, \ldots, a_n$ be real numbers.Prove that you can select $\varepsilon _1, \varepsilon _2, \ldots, \varepsilon _n\in\{-1,1\}$ such that$$\left( \sum_{i=1}^{n}a_{i}\right)^2 +\left( \sum_{i=1}^{n}\varepsilon _ia_{i}\right)^2 \leq(n+1)\left( \sum_{i=1}^{n}a^2_{i}\right).$$

Let $\mathbb R$ be the set of real numbers. We denote by $\mathcal F$ the set of all functions $f\colon\mathbb R\to\mathbb R$ such that $$f(x + f(y)) = f(x) + f(y)$$ for every $x,y\in\mathbb R$ Find all rational numbers $q$ such that for every function $f\in\mathcal F$, there exists some $z\in\mathbb R$ satisfying $f(z)=qz$.

Find all positive integers $n$ for which there exist non-negative integers $a_1, a_2, \ldots, a_n$ such that \[ \frac{1}{2^{a_1}} + \frac{1}{2^{a_2}} + \cdots + \frac{1}{2^{a_n}} = \frac{1}{3^{a_1}} + \frac{2}{3^{a_2}} + \cdots + \frac{n}{3^{a_n}} = 1. \] [i]Proposed by Dusan Djukic, Serbia[/i]

For a natural number $n$, let $T(n)$ denote the number of ways we can place $n$ objects of weights $1,2,\cdots, n$ on a balance such that the sum of the weights in each pan is the same. Prove that $T(100) > T(99)$.

Suppose that $S$ is a finite set of real numbers with the property that any two distinct elements of $S$ form an arithmetic progression with another element in $S$. Give an example of such a set with 5 elements and show that no such set exists with more than $5$ elements.

A not necessary nonplanar polygon in $\mathbb{R}^3$ is called [b]Grid Polygon[/b] if each of it's edges are parallel to one of the axes. (a) There's a right angle between each two neighbour sides of the grid polygon, the plane containing this angle could be parallel to either $xy$ plane, $yz$ plane, or $xz$ plane. Prove that parity of the number of the angles that the plane containing each of them is parallel to $xy$ plane is equal to parity of the number of the angles that the plane containing each of them is parallel to $yz$ plane and parity of the number of the angles that the plane containing each of them is parallel to $zx$ plane. (b) A grid polygon is called [b]Inscribed[/b] if there's a point in the space that has an equal distance from all of the vertices of the polygon. Prove that any nonplanar grid hexagon is inscribed. (c) Does there exist a grid 2014-gon without repeated vertices such that there exists a plane that intersects all of it's edges? (d) If $a,b,c \in \mathbb{N}-\{1\}$, prove that $a,b,c$ are sidelengths of a triangle iff there exists a grid polygon in which the number of it's edges that are parallel to $x$ axis is $a$, the number of it's edges that are parallel to $y$ axis is $b$ and the number of it's edges that are parallel to $z$ axis is $c$. Time allowed for this exam was 1 hour.

$ a,b,c>0 $ and $ abc=1 $. Prove that $\frac{1}{2}\ (\sqrt{a}\ +\sqrt{b}\ + \sqrt{c}\ ) +\frac{1}{1+a}\ + \frac{1}{1+b}\ + \frac{1}{1+c}\ge\ 3 $. ( The official problem is with $ abc = 1 $ but it can be proved without using it. )

Let $N$ be a positive integer. Suppose given any real $x\in (0,1)$ with decimal representation $0.a_1a_2a_3a_4\cdots$, one can color the digits $a_1,a_2,\cdots$ with $N$ colors so that the following hold: 1. each color is used at least once; 2. for any color, if we delete all the digits in $x$ except those of this color, the resulting decimal number is rational. Find the least possible value of $N$. [i]~Sutanay Bhattacharya[/i]

Bernardo chooses a three-digit positive integer $N$ and writes both its base-5 and base-6 representations on a blackboard. Later LeRoy sees the two numbers Bernardo has written. Treating the two numbers as base-10 integers, he adds them to obtain an integer $S$. For example, if $N=749$, Bernardo writes the numbers 10,444 and 3,245, and LeRoy obtains the sum $S=13,689$. For how many choices of $N$ are the two rightmost digits of $S$, in order, the same as those of $2N$? ${ \textbf{(A)}\ 5\qquad\textbf{(B)}\ 10\qquad\textbf{(C)}\ 15\qquad\textbf{(D}}\ 20\qquad\textbf{(E)}\ 25 $

For how many integer values of $m$, (i) $1\le m \le 5000$ (ii) $[\sqrt{m}] =[\sqrt{m+125}]$ Note: $[x]$ is the greatest integer function

Let $p>$ be a prime number and $S$ be a set of $p+1$ integers. Prove that there exist pairwise distinct numbers $a_1,a_2,...,a_{p-1}\in S$ that $$ a_1+2a_2+3a_3+...+(p-1)a_{p-1}$$ is divisible by $p$.

Let $ \alpha,\beta$ be real numbers satisfying $ 1 < \alpha < \beta.$ Find the greatest positive integer $ r$ having the following property: each of positive integers is colored by one of $ r$ colors arbitrarily, there always exist two integers $ x,y$ having the same color such that $ \alpha\le \frac {x}{y}\le\beta.$

One convex quadrilateral is inside another. Can it turn out that the sum of the lengths of the diagonals of the outer quadrilateral is less than the sum of the lengths of the diagonals of the inner?

Let $f^{(n)}(x)$ denote the $n^{\text{th}}$ iterate of function $f$, i.e $f^{(1)}(x)=f(x)$, $f^{(n+1)}(x)=f(f^{(n)}(x))$. Let $p(n)$ be a given polynomial with integer coefficients, which maps the positive integers into the positive integers. Is it possible that the functional equation $f^{(n)}(n)=p(n)$ has exactly one solution $f$ that maps the positive integers into the positive integers? [i]Submitted by Dávid Matolcsi and Kristóf Szabó, Budapest[/i]

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$

Compute the sum of all 2-digit prime numbers $p$ such that there exists a prime number $q$ for which $100q + p$ is a perfect square.

Bishops on a chessboard move along the diagonals ( that is , on lines parallel to the two main diagonals ) . Prove that the maximum number of non-attacking bishops on an $n*n$ chessboard is $2n-2$. (Two bishops are said to be attacking if they are on a common diagonal).

Let $\mathbb N$ denote the set of positive integers. Find all functions $f: \mathbb{N} \to \mathbb{N}$ such that: (i) The greatest common divisor of the sequence $f(1), f(2), \dots$ is $1$. (ii) For all sufficiently large integers $n$, we have $f(n) \neq 1$ and \[ f(a)^n \mid f(a+b)^{a^{n-1}} - f(b)^{a^{n-1}} \] for all positive integers $a$ and $b$. [i]Proposed by Yang Liu[/i]