Let $a,b,c$ be positive reals. Prove that \[ \frac{(a-b)(a-c)}{2a^2 + (b+c)^2} + \frac{(b-c)(b-a)}{2b^2 + (c+a)^2} + \frac{(c-a)(c-b)}{2c^2 + (a+b)^2} \geq 0. \] [i]Calvin Deng.[/i]

Let $a_1,a_2,\ldots,a_n$ be a finite sequence of non negative integers, its subsequences are the sequences of the form $a_i,a_{i+1},\ldots,a_j$ with $1\le i\le j \le n$. Two subsequences are said to be equal if they have the same length and have the same terms, that is, two subsequences $a_i,a_{i+1},\ldots,a_j$ and $a_u,a_{u+1},\ldots a_v$ are equal iff $j-i=u-v$ and $a_{i+k}=a_{u+k}$ forall integers $k$ such that $0\le k\le j-1$. Finally, we say that a subsequence $a_i,a_{i+1},\ldots,a_j$ is palindromic if $a_{i+k}=a_{j-k}$ forall integers $k$ such that $0\le k \le j-i$ What is the greatest number of different palindromic subsequences that can a palindromic sequence of length $n$ contain?

Are there integers $k$ and $m$ for which $$\frac{(k-3)(k-2)(k-1)k+1}{(k+1)(k+2)(k+3)(k+4)+1}=m(m+1)+(m+1)(m+2)+(m+2)m \,\, ?$$

Find all the functions $f:\mathbb{R}\to\mathbb{R}$ which satisfy the functional equation $$f(xy^2)+f(x^2y)=y^2f(x)+x^2f(y)$$ for every $x,y\in\mathbb{R}$ and $f(2008) =f(-2008)$ [i](nooonuii)[/i]

At a math contest there are $2n$ students participating. Each of them submits a problem to the jury, which thereafter gives each students one of the $2n$ problems submitted. One says that the contest is [i]fair[/i] is there are $n$ participants which receive their problems from the other $n$ participants. Prove that the number of distributions of the problems in order to obtain a fair contest is a perfect square.

Find the value of sum $\sum_{n=1}^\infty A_n$, where $$A_n=\sum_{k_1=1}^\infty\cdots\sum_{k_n=1}^\infty \frac{1}{k_1^2}\frac{1}{k_1^2+k_2^2}\cdots\frac{1}{k_1^2+\cdots+k_n^2}.$$

The diagram below shows a shaded region bounded by a semicircular arc of a large circle and two smaller semicircular arcs. The smallest semicircle has radius $8$, and the shaded region has area $180\pi$. Find the diameter of the large circle. [asy] import graph; size(3cm); fill((-22.5,0)..(0,22.5)..(22.5,0)--cycle,rgb(.76,.76,.76)); fill((6.5,0.1)..(14.5,-8)..(22.5,0.1)--cycle,rgb(.76,.76,.76)); fill((-22.5,-0.1)..(-8,14.5)..(6.5,-0.1)--cycle,white); draw((-22.5,0)..(-8,14.5)..(6.5,0),linewidth(1.5)); draw((6.5,0)..(14.5,-8)..(22.5,0),linewidth(1.5)); draw(Circle((0,0),22.5),linewidth(1.5)); [/asy]

[4] Let $x_1,x_2,\ldots,x_{100}$ be defined so that for each $i$, $x_i$ is a (uniformly) random integer between $1$ and $6$ inclusive. Find the expected number of integers in the set $\{x_1,x_1+x_2,\ldots,x_1+x_2+\cdots+x_{100}\}$ that are multiples of $6$.

Prove that among any $2n+1$ irrational numbers there are $n+1$ numbers such that the sum of any $k$ of them is irrational, for all $k \in \{1,2,3,\ldots, n+1 \}$.

Suppose $A\in{M_2(\mathbb{C})}$ is not a scalar matrix. Let $S=\{B\in{M_2(\mathbb{C})}|\ AB=BA\}$. If $X,\ Y\in{S}$, then prove that $XY=YX$.

Let $n$ be a natural number. Find all solutions $x$ of the system of equations $$\left\{\begin{matrix} sinx+cosx=\frac{\sqrt{n}}{2}\\tg\frac{x}{2}=\frac{\sqrt{n}-2}{3}\end{matrix}\right.$$ On interval $\left[0,\frac{\pi}{4}\right).$

Call a set $S$ [i]product-free[/i] if there do not exist $a, b, c \in S$ (not necessarily distinct) such that $a b = c$. For example, the empty set and the set $\{16, 20\}$ are product-free, whereas the sets $\{4, 16\}$ and $\{2, 8, 16\}$ are not product-free. Find the number of product-free subsets of the set $\{1, 2, 3, 4, 5, 6, 7, 8, 9, 10\}$.

(A.Akopyan, V.Dolnikov) Given a set of points inn the plane. It is known that among any three of its points there are two such that the distance between them doesn't exceed 1. Prove that this set can be divided into three parts such that the diameter of each part does not exceed 1.

Let $\tau(n)$ denote the number of positive divisors of the positive integer $n$. Prove that there exist infinitely many positive integers $a$ such that the equation $ \tau(an)=n $ does not have a positive integer solution $n$.

Let $\left ( a_{n} \right )_{n \geq 1}$ be an increasing sequence of positive integers such that $a_1=1$, and for all positive integers $n$, $a_{n+1}\leq 2n$. Prove that for every positive $n$; there exists positive integers $p$ and $q$ such that $n=a_{p}-a_{q}$.

Let $ \triangle{ABC}$ be a triangle with $ AB\not\equal{}AC$. The incircle with centre $ I$ touches $ BC$, $ CA$, $ AB$ at $ D$, $ E$, $ F$, respectively. Furthermore let $ M$ the midpoint of $ EF$ and $ AD$ intersect the incircle at $ P\not\equal{}D$. Show that $ PMID$ ist cyclic.