Prove the inequality: \[\sum_{i < j}{\frac {a_{i}a_{j}}{a_{i} \plus{} a_{j}}}\leq \frac {n}{2(a_{1} \plus{} a_{2} \plus{}\cdots \plus{} a_{n})}\cdot \sum_{i < j}{a_{i}a_{j}}\] for positive reals $ a_{1},a_{2},\ldots,a_{n}$. [i]Proposed by Dusan Dukic, Serbia[/i]

Solve the equation $$\left| ... \left|\left||x^2-x| -1\right|-1 \right|...-1\right|=x^2-2x-14.$$ (There are $11$ units on the left side.)

Find all integers $m$ and $n$ such that the fifth power of $m$ minus the fifth power of $n$ is equal to $16mn$.

Find all functions $f,g,h: \mathbb{R} \mapsto \mathbb{R}$ such that $f(x) - g(y) = (x-y) \cdot h(x+y)$ for $x,y \in \mathbb{R}.$

$ f: \mathbb N \times \mathbb Z \rightarrow \mathbb Z$ satisfy the given conditions $ a)$ $ f(0,0)\equal{}1$ , $ f(0,1)\equal{}1$ , $ b)$ $ \forall k \notin \left\{0,1\right\}$ $ f(0,k)\equal{}0$ and $ c)$ $ \forall n \geq 1$ and $ k$ , $ f(n,k)\equal{}f(n\minus{}1,k)\plus{}f(n\minus{}1,k\minus{}2n)$ find the sum $ \displaystyle\sum_{k\equal{}0}^{\binom{2009}{2}}f(2008,k)$

Without using a calculator, prove that $$2^{1995} >5^{854},$$

[b]Q.[/b] Find all polynomials $P: \mathbb{R \times R}\to\mathbb{R\times R}$ with real coefficients, such that $$P(x,y) = P(x+y,x-y), \ \forall\ x,y \in \mathbb{R}.$$ [i]Proposed by TuZo[/i]

The plane is divided into domains by $ n$ straight lines in general position, where $ n \geq 3$. Determine the maximum and minimum possible number of angular domains among them. (We say that $ n$ lines are in general position if no two are parallel and no three are concurrent.)

The sequence $ (x_n)_{n \geq 1}$ is defined by: $ x_1\equal{}1$ $ x_{n\plus{}1}\equal{}\frac{x_n}{n}\plus{}\frac{n}{x_n}$ Prove that $ (x_n)$ increases and $ [x_n^2]\equal{}n$.

Let $p(x)$ be a polynomial of degree $n$ with real coefficients such that $p(x) \ge 0$ for all $x$. Prove that $p(x)+ p'(x)+ p''(x)+...+ p^{(n)}(x) \ge 0$.

Let $a,b,c$ be real numbers. Consider the quadratic equation in $\cos{x}$ \[ a \cos^2{x}+b \cos{x}+c=0. \] Using the numbers $a,b,c$ form a quadratic equation in $\cos{2x}$ whose roots are the same as those of the original equation. Compare the equation in $\cos{x}$ and $\cos{2x}$ for $a=4$, $b=2$, $c=-1$.

Two perpendicular lines pass through the point $F(1;1)$ of coordinate plane. One of them intersects hyperbola $y=\frac{1}{2x}$ at $A$ and $C$ ($C_x>A_x$), and the other one intersects the left part of hyperbola at $B$ and the right at $D$. Let $m=(C_x-A_x)(D_x-B_x)$ Find the area of non-convex quadraliteral $ABCD$ (in terms of $m$)

[u]Set 2[/u] [b]2.1[/b] A school has $50$ students and four teachers. Each student has exactly one teacher, such that two teachers have $10$ students each and the other two teachers have $15$ students each. You survey each student in the school, asking the number of classmates they have (not including themself or the teacher). What is the average of all $50$ responses? [b]2.2[/b] Let $T$ be the answer from the previous problem. A ball is thrown straight up from the ground, reaching (maximum) height $T+1$. Then the ball bounces on the ground and rebounds to height $T-1$. The ball continues bouncing indefinitely, and the height of each bounce is $r$ times the height of the previous bounce for some constant $r$. What is the total vertical distance that the ball travels? [b]2.3[/b] Let $T$ be the answer from the previous problem. The polynomial equation $$x^3 + x^2 - (T + 1)x + (T- 1) = 0$$ has one (integer) solution for x which does not depend on $T$ and two solutions for $x$ which do depend on $T$. Find the greatest solution for $x$ in this equation. (Hint: Find the independent solution for $x$ while you wait for $T$.) PS. You should use hide for answers.

Let $n$ be a positive integer. Given is a subset $A$ of $\{0,1,...,5^n\}$ with $4n+2$ elements. Prove that there exist three elements $a<b<c$ from $A$ such that $c+2a>3b$. [i]Proposed by Dominik Burek and Tomasz Ciesla, Poland[/i]

Show that for any function $ f: (0,\plus{}\infty)\to (0,\plus{}\infty)$ there exist real numbers $ x>0$ and $ y>0$ such that: $ f(x\plus{}y)<yf(f(x)).$ [b]Dan Schwarz[/b]

Denote by $ S$ the set of all positive integers. Find all functions $ f: S \rightarrow S$ such that \[ f (f^2(m) \plus{} 2f^2(n)) \equal{} m^2 \plus{} 2 n^2\] for all $ m,n \in S$. [i]Bulgaria[/i]

Find the largest possible integer $k$, such that the following statement is true: Let $2009$ arbitrary non-degenerated triangles be given. In every triangle the three sides are coloured, such that one is blue, one is red and one is white. Now, for every colour separately, let us sort the lengths of the sides. We obtain \[ \left. \begin{array}{rcl} & b_1 \leq b_2\leq\ldots\leq b_{2009} & \textrm{the lengths of the blue sides }\\ & r_1 \leq r_2\leq\ldots\leq r_{2009} & \textrm{the lengths of the red sides }\\ \textrm{and } & w_1 \leq w_2\leq\ldots\leq w_{2009} & \textrm{the lengths of the white sides }\\ \end{array}\right.\] Then there exist $k$ indices $j$ such that we can form a non-degenerated triangle with side lengths $b_j$, $r_j$, $w_j$. [i]Proposed by Michal Rolinek, Czech Republic[/i]

Let \(c\) be a positive real number. Alice wishes to pick an integer \(n\) and a sequence \(a_1\), \(a_2\), \(\ldots\) of distinct positive integers such that \(a_{i} \leq ci\) for all positive integers \(i\) and \[n, \qquad n + a_1, \qquad n + a_1 - a_2, \qquad n + a_1 - a_2 + a_3, \qquad \cdots\] is a sequence of distinct nonnegative numbers. Find all \(c\) such that Alice can fulfil her wish.

Solve the inequality $$(x-1)(x^2-1)(x^3-1)\cdot ...\cdot (x^{100}-1)(x^{101}-1)\ge 0$$

Find the minimum value of $S = |x + 1| + |x + 5|+ |x + 14| + |x + 97| + |x + 1920|$.

Find all real solutions of the system of equations $\begin{cases} (x + y) ^3 = z \\ (y + z) ^3 = x \\ ( z+ x) ^3 = y \end{cases} $ (Based on an idea by A . Aho , J. Hop croft , J. Ullman )

An infinite geometric series has sum $2005$. A new series, obtained by squaring each term of the original series, has $10$ times the sum of the original series. The common ratio of the original series is $\frac{m}{n}$ where $m$ and $n$ are relatively prime integers. Find $m+n$.

Let $n$ be a positive integer. Show that there exist a polynomial $P(x)$ with integer coefficient that satisfy the following [list] [*]Degree of $P(x)$ is at most $2^n - n -1$ [*]$|P(k)| = (k-1)!(2^n-k)!$ for each $k \in \{1,2,3,\dots,2^n\}$ [/list]

Let $a, b, c$ be three positive real numbers. a) Prove that there exists a unique positive real number $d$ that satisfies $$\frac{1}{a + d}+ \frac{1}{b + d}+\frac{1}{c + d}=\frac{2}{d} .$$ b) With $x, y, z$ being positive real numbers such that $ax + by + cz = xyz$, prove the inequality $$x + y + z \ge \frac{2}{d}\sqrt{(a + d)(b + d)(c + d)}.$$

Given a positive integer $n$ and $x_1 \leq x_2 \leq \ldots \leq x_n, y_1 \geq y_2 \geq \ldots \geq y_n$, satisfying \[\displaystyle\sum_{i = 1}^{n} ix_i = \displaystyle\sum_{i = 1}^{n} iy_i\] Show that for any real number $\alpha$, we have \[\displaystyle\sum_{i =1}^{n} x_i[i\alpha] \geq \displaystyle\sum_{i =1}^{n} y_i[i\alpha]\] Here $[\beta]$ denotes the greastest integer not larger than $\beta$.