For prime number $p$, prove that there are integers $a$, $b$, $c$, $d$ such that for every integer $n$, the expression $n^4+1-\left( n^2+an+b \right) \left(n^2+cn+d \right)$ is a multiple of $p$.

Let $d_n$ be the last digit, distinct from 0, in the decimal expansion of $n!$. Prove that the sequence $d_1,d_2,d_3, \ldots$ is not periodic.

Is there a function $f(x)$ defined for all $x$ and such that for some $a$ and all $x$ holds the equality $$f(x) + f(2x^2 - 1) = 2x + a?$$

The graph of a function $f: \mathbb{R}\to\mathbb{R}$ has two has at least two centres of symmetry. Prove that $f$ can be represented as sum of a linear and periodic funtion.

Let $\ell$ be a positive integer, and let $m,n$ be positive integers with $m\geq n$, such that $A_1,A_2,\cdots,A_m,B_1,\cdots,B_m$ are $m+n$ pairwise distinct subsets of the set $\{1,2,\cdots,\ell\}$. It is known that $A_i\Delta B_j$ are pairwise distinct, $1\leq i\leq m, 1\leq j\leq n$, and runs over all nonempty subsets of $\{1,2,\cdots,\ell\}$. Find all possible values of $m,n$.

Find all functions $f$ , defined and having values in the set of integer numbers, for which the following conditions are satisfied: (a) $f(1) = 1$; (b) for every two whole (integer) numbers $m$ and $n$, the following equality is satisfied: $$f(m+n)·(f(m)-f(n)) = f(m-n)·(f(m)+ f(n))$$

Consider three sequences $(a_n)_{n=1}^{^\infty}$, $(b_n)_{n=1}^{^\infty}$ , $(c_n)_{n=1}^{^\infty}$, each of which has pairwisedistinct terms. Prove that there exist two indices $k$ and $l$ for which $k < l$, $$a_k < a_l , b_k < b_l , \,\,\, and \,\,\, c_k < c_l.$$

Let $n$ be a positive integer and let $x_1,\ldots,x_n,y_1,\ldots,y_n$ be integers satisfying the following condition: the numbers $x_1,\ldots,x_n$ are pairwise distinct and for every positive integer $m$ there exists a polynomial $P_m$ with integer coefficients such that $P_m(x_i) - y_i$, $i=1,\ldots,n$, are all divisible by $m$. Prove that there exists a polynomial $P$ with integer coefficients such that $P(x_i) = y_i$ for all $i=1,\ldots,n$.

Find all polynomials $f(x)$ with integer coefficients such that the coefficients of both $f(x)$ and $[f(x)]^3$ lie in the set $\{0,1, -1\}$.

Prove that for $ n > 0$ and $ a\neq0$ the polynomial $ p(z) \equal{} az^{2n \plus{} 1} \plus{} bz^{2n} \plus{} \bar bz \plus{} \bar a$ has a root on unit circle

Prove that the polynom $ X^3-aX-a+1 $ has three integer roots, for an infinite number of integers $ a. $ [i]Liviu Parsan[/i]

Let a sequences: $ x_0\in [0;1],x_{n\plus{}1}\equal{}\frac56\minus{}\frac43 \Big|x_n\minus{}\frac12\Big|$. Find the "best" $ |a;b|$ so that for all $ x_0$ we have $ x_{2009}\in [a;b]$

For positive numbers $a, b, c$ satisfying condition $a+b+c<2$, Prove that $$ \sqrt{a^2 +bc}+\sqrt{b^2 +ca}+\sqrt{c^2 + ab}<3. $$

A sequence $x_1,x_2,x_3,...$ has the following properties: (a) $1 = x_1 < x_2 < x_3 < ...$ (b) $x_{n+1} \le 2n$ for all $n \in N$. Prove that for each positive integer $k$ there exist indices $i$ and $j$ such that $k =x_i -x_j$.

The positive integers $x_1$, $x_2$, $\ldots$, $x_5$, $x_6 = 144$ and $x_7$ are such that $x_{n+3} = x_{n+2}(x_{n+1}+x_n)$ for $n=1,2,3,4$. Determine the value of $x_7$.

Find all pairs of integers $(a,b)$ such that $(b^2+7(a-b))^2=a^{3}b$.

$p$ is a polynomial with integer coefficients and for every natural $n$ we have $p(n)>n$. $x_k $ is a sequence that: $x_1=1, x_{i+1}=p(x_i)$ for every $N$ one of $x_i$ is divisible by $N.$ Prove that $p(x)=x+1$

$a,b,c \in (0,1)$ and $x,y,z \in ( 0, \infty)$ reals satisfies the condition $a^x=bc,b^y=ca,c^z=ab$. Prove that \[ \dfrac{1}{2+x}+\dfrac{1}{2+y}+\dfrac{1}{2+z} \leq \dfrac{3}{4} \] \\

A [i]root of unity[/i] is a complex number that is a solution to $ z^n \equal{} 1$ for some positive integer $ n$. Determine the number of roots of unity that are also roots of $ z^2 \plus{} az \plus{} b \equal{} 0$ for some integers $ a$ and $ b$.

Twenty kilograms of cheese are on sale in a grocery store. Several customers are lined up to buy this cheese. After a while, having sold the demanded portion of cheese to the next customer, the salesgirl calculates the average weight of the portions of cheese already sold and declares the number of customers for whom there is exactly enough cheese if each customer will buy a portion of cheese of weight exactly equal to the average weight of the previous purchases. Could it happen that the salesgirl can declare, after each of the first $10$ customers has made their purchase, that there just enough cheese for the next $10$ customers? If so, how much cheese will be left in the store after the first $10$ customers have made their purchases? (The average weight of a series of purchases is the total weight of the cheese sold divided by the number of purchases.)

Determine all functions $f:\mathbb{R} \rightarrow \mathbb{R}$ such that for all $x,y \in \mathbb{R}$ we have: $$xf(x+y)+yf(y-x) = f(x^2+y^2)\,.$$ [i]Authored by Nikola Velov[/i]

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]

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

Compute the number of sequences of integers $(a_1,\ldots,a_{200})$ such that the following conditions hold. [list] [*] $0\leq a_1<a_2<\cdots<a_{200}\leq 202.$ [*] There exists a positive integer $N$ with the following property: for every index $i\in\{1,\ldots,200\}$ there exists an index $j\in\{1,\ldots,200\}$ such that $a_i+a_j-N$ is divisible by $203$. [/list]

Let $(x,y,z)$ be an ordered triplet of real numbers that satisfies the following system of equations: \begin{align*}x+y^2+z^4&=0,\\y+z^2+x^4&=0,\\z+x^2+y^4&=0.\end{align*} If $m$ is the minimum possible value of $\lfloor x^3+y^3+z^3\rfloor$, find the modulo $2007$ residue of $m$.