The polynomial $P(x)=a_0+a_1x+a_2x^2+...+a_8x^8+2009x^9$ has the property that $P(\tfrac{1}{k})=\tfrac{1}{k}$ for $k=1,2,3,4,5,6,7,8,9$. There are relatively prime positive integers $m$ and $n$ such that $P(\tfrac{1}{10})=\tfrac{m}{n}$. Find $n-10m$.

Prove that $(a^2 + b^2 + c^2)^ 2 = 2 (a^4 + b^4 + c^4)$ if $a + b + c = 0$.

It is well known that the mathematical constant $e$ can be written in the form $e = \tfrac{1}{0!}+\tfrac{1}{1!}+\tfrac{1}{2!}+\cdots$. With this in mind, determine the value of \[\sum_{j=3}^\infty\dfrac{j}{\lfloor\frac j2\rfloor!}.\] Express your answer in terms of $e$.

Functions $f,g:\mathbb{Z}\to\mathbb{Z}$ satisfy $$f(g(x)+y)=g(f(y)+x)$$ for any integers $x,y$. If $f$ is bounded, prove that $g$ is periodic.

Find all solutions of the equation $$sin\pi \sqrt x+cos\pi \sqrt x=(-1)^{\lfloor \sqrt x \rfloor }$$

Given function $f(x) = \sin x + \sin \pi x$ and positive number $d$. Prove that there exists real number $p$ such that $|f(x + p) - f(x)| < d$ holds for all real numbers $x$, and the value of $p$ can be arbitrarily large.

Let $a_1,a_2,\ldots a_n,k$, and $M$ be positive integers such that $$\frac{1}{a_1}+\frac{1}{a_2}+\cdots+\frac{1}{a_n}=k\quad\text{and}\quad a_1a_2\cdots a_n=M.$$ If $M>1$, prove that the polynomial $$P(x)=M(x+1)^k-(x+a_1)(x+a_2)\cdots (x+a_n)$$ has no positive roots.

The polynomials $f(x)$ and $g(x)$ are given. The points $A_1(f(1),g(1)),\ldots,A_n(f(n),g(n))$ are marked on the coordinate plane. It turns out that $A_1\ldots A_n$ is a regular $n{}$-gon. Prove that the degree of at least one of $f{}$ and $g{}$ is at least $n-1$. [i]Proposed by V. Bragin[/i]

Let $n \geqslant 3$ be an integer, and let $x_1,x_2,\ldots,x_n$ be real numbers in the interval $[0,1]$. Let $s=x_1+x_2+\ldots+x_n$, and assume that $s \geqslant 3$. Prove that there exist integers $i$ and $j$ with $1 \leqslant i<j \leqslant n$ such that \[2^{j-i}x_ix_j>2^{s-3}.\]

Let $a,b,c\geq 0$ and $a+b+c=1.$ Prove that$$\frac{a}{2a+1}+\frac{b}{3b+1}+\frac{c}{6c+1}\leq \frac{1}{2}.$$ [size=50](Marian Dinca)[/size]

Suppose $a$, $b$, and $c$ are relatively prime integers such that \[\frac{a}{b+c} = 2\qquad\text{and}\qquad \frac{b}{a+c} = 3.\] What is $|c|$?

Let $a,b,c$ be positive real numbers such that $a+b+c=1$. Prove that \[\frac {a}{b} + \frac {a}{c} + \frac {c}{b} + \frac {c}{a} + \frac {b}{c} + \frac {b}{a} + 6 \geq 2\sqrt{2}\left (\sqrt{\frac{1-a}{a}} + \sqrt{\frac{1-b}{b}} + \sqrt{\frac{1-c}{c}}\right ).\] When does equality hold?

The positive integers are partitioned into 2 sequences $a_1<a_2<\dots$ and $b_1<b_2<\dots$ such that $b_n=a_n+n$ for every positive integer $n$. Show that $a_n+b_n=a_{b_n}$.

Find all functions $f: Z \to Z$ that satisfy $$f(-f (x) - f (y))= 1 -x - y$$ for all $x, y \in Z$

Show that the polynomial $x^{8} +98 x^{4}+1$ can be expressed as the product of two nonconstant polynomials with integer coefficients.

Find all pair $(x,y)$ of positive integers satisfying $$\left|\frac{x}{y}-\sqrt2\right|<\frac{1}{y^3}.$$

If $ x$ is a real number such that $ x^2\minus{}x$ and $ x^n\minus{}x$ are integers for some $ n \ge 3$, prove that $ x$ is an integer.

For a sequence $x_1,x_2,\ldots,x_n$ of real numbers, we define its $\textit{price}$ as \[\max_{1\le i\le n}|x_1+\cdots +x_i|.\] Given $n$ real numbers, Dave and George want to arrange them into a sequence with a low price. Diligent Dave checks all possible ways and finds the minimum possible price $D$. Greedy George, on the other hand, chooses $x_1$ such that $|x_1 |$ is as small as possible; among the remaining numbers, he chooses $x_2$ such that $|x_1 + x_2 |$ is as small as possible, and so on. Thus, in the $i$-th step he chooses $x_i$ among the remaining numbers so as to minimise the value of $|x_1 + x_2 + \cdots x_i |$. In each step, if several numbers provide the same value, George chooses one at random. Finally he gets a sequence with price $G$. Find the least possible constant $c$ such that for every positive integer $n$, for every collection of $n$ real numbers, and for every possible sequence that George might obtain, the resulting values satisfy the inequality $G\le cD$. [i]Proposed by Georgia[/i]

A real number $x$ satisfies $9^x + 3^x = 6$. Compute the value of $16^{1/x} + 4^{1/x} $.

Let $\{x_i\}^{\infty}_{i=1}$ and $\{y_i\}^{\infty}_{i=1}$ be sequences of real numbers such that $x_1=y_1=\sqrt{3}$, $$x_{n+1}=x_n+\sqrt{1+x_n^2}\quad\text{and}\quad y_{n+1}=\frac{y_n}{1+\sqrt{1+y_n^2}}$$ for all $n\geq 1$. Prove that $2<x_ny_n<3$ for all $n>1$.

Let's call a set of numbers [i]lucky[/i] if it cannot be divided into two nonempty groups so that the product of the sum of the numbers in one group and the sum of the numbers in the other is positive. The teacher wrote several integers on the blackboard. Prove that the children can add another integer to the existing ones so that the resulting set is lucky. [i]A. Kuznetsov[/i]

Find all functions $f: \mathbb{R} \to \mathbb{R}$ such that$$f(xf(y)-y) + f(xy-x) + f(x+y) = 2xy$$for all $x, y \in \mathbb{R}$.

Find all the following functions $f:R\to R$ , which for arbitrary valid $x,y$ holds equality: $$f(xf(x+y))+f((x+y)f(y))=(x+y)^2$$ (Vadym Koval)

Let $\Bbb{N}$ be the set of positive integers. For each subset $\mathcal{X}$ of $\Bbb{N}$ we define the set $\Delta(\mathcal{X})$ as the set of all numbers $| m - n |,$ where $m$ and $n$ are elements of $\mathcal{X}$, ie: $$\Delta (\mathcal{X}) = \{ |m-n| \ | \ m, n \in \mathcal{X} \}$$ Let $\mathcal A$ and $\mathcal B$ be two infinite, disjoint sets whose union is $\Bbb{N.}$ a) Prove that the set $\Delta (\mathcal A) \cap \Delta (\mathcal B)$ has infinitely many elements. b) Prove that there exists an infinite subset $\mathcal C$ of $\Bbb{N}$ such that $\Delta (\mathcal C)$ is a subset of $\Delta (\mathcal A) \cap \Delta (\mathcal B).$

Let $F = \max_{1 \leq x \leq 3} |x^3 - ax^2 - bx - c|$. When $a$, $b$, $c$ run over all the real numbers, find the smallest possible value of $F$.