Let $\mathbb{Z}$ be the set of all integers. Find all pairs of integers $(a,b)$ for which there exist functions $f \colon \mathbb{Z}\rightarrow \mathbb{Z}$ and $g \colon \mathbb{Z} \rightarrow \mathbb{Z}$ satisfying \[ f(g(x))=x+a \quad\text{and}\quad g(f(x))=x+b \] for all integers $x$. [i]Proposed by Ankan Bhattacharya[/i]

The first five terms of a sequence are $1, 2, 3, 4$ and $5$. From the sixth term on, each term is $1$ less than the product of all the proceeding ones. Prove that the product of the first$ 70$ terms is equal to the sum of their squares. (LD Kurliandchik)

Let $x, y$, and $z$ be positive real numbers, such that $x^2 + y^2 + z^2 = 3$. Prove the inequality \[\frac{x^3}{2 + x} + \frac{y^3}{2 + y} + \frac{z^3}{2 + z} \ge 1.\] When does the equality hold?

Find the coefficients of $x^{17}$ and $x^{18}$ after expansion and collecting the terms of $(1+x^5+x^7)^{20}$.

A set $S$ consists of $k$ sequences of $0,1,2$ of length $n$. For any two sequences $(a_i),(b_i)\in S$ we can construct a new sequence $(c_i)$ such that $c_i=\left\lfloor\frac{a_i+b_i+1}2\right\rfloor$ and include it in $S$. Assume that after performing finitely many such operations we obtain all the $3n$ sequences of $0,1,2$ of length $n$. Find the least possible value of $k$.

Let $f_1 = (a_1, a_2, \dots , a_n) , n > 2$, be a sequence of integers. From $f_1$ one constructs a sequence $f_k$ of sequences as follows: if $f_k = (c_1, c_2, \dots, cn)$, then $f_{k+1} = (c_{i_{1}}, c_{i_{2}}, c_{i_{3}} + 1, c_{i_{4}} + 1, . . . , c_{i_{n}} + 1)$, where $(c_{i_{1}}, c_{i_{2}},\dots , c_{i_{n}})$ is a permutation of $(c_1, c_2, \dots, c_n)$. Give a necessary and sufficient condition for $f_1$ under which it is possible for $f_k$ to be a constant sequence $(b_1, b_2,\dots , b_n), b_1 = b_2 =\cdots = b_n$, for some $k.$

Find every real-valued function $f$ whose domain is an interval $I$ (finite or infinite) having $0$ as a left-hand endpoint, such that for every positive $x\in I$ the average of $f$ over the closed interval $[0,x]$ is equal to $\sqrt{ f(0) f(x)}.$

A positive rational number $x$ is called [i]banzai [/i] if the following conditions are met: $\bullet$ $x=\frac{p}{q}>1$ where $p,q$ are comprime natural numbers $\bullet$ exist constants $\alpha,N$ such that for all integers $n\geq N$,$$\mid \left\{\,x^n\right\} -\alpha\mid \leq \dfrac{1}{2(p+q)}.$$ Find the total number of banzai numbers. Note:$\left\{\,x\right\}$ means fractional part of $x$ [i](tatari/nightmare)[/i]

The numbers $\frac{1}{1}, \frac{1}{2}, ... , \frac{1}{2010}$ are written on a blackboard. A student chooses any two of the numbers, say $x$, $y$, erases them and then writes down $x + y + xy$. He continues to do this until only one number is left on the blackboard. What is this number?

Three different non-zero real numbers $a,b,c$ satisfy the equations $a+\frac{2}{b}=b+\frac{2}{c}=c+\frac{2}{a}=p $, where $p$ is a real number. Prove that $abc+2p=0.$

A polynomial $P$ with integer coefficients is [i]square-free[/i] if it is not expressible in the form $P = Q^2R$, where $Q$ and $R$ are polynomials with integer coefficients and $Q$ is not constant. For a positive integer $n$, let $P_n$ be the set of polynomials of the form $$1 + a_1x + a_2x^2 + \cdots + a_nx^n$$ with $a_1,a_2,\ldots, a_n \in \{0,1\}$. Prove that there exists an integer $N$ such that for all integers $n \geq N$, more than $99\%$ of the polynomials in $P_n$ are square-free. [i]Navid Safaei, Iran[/i]

Let $f$ be a function such that $f (x + y) = f (x) + f (y)$ for all $x,y \in R$ and $f (1) = 100$. Calculate $\sum_{k = 1}^{10}f (k!)$.

Let $p(1), p(2), \ldots, p(k)$ be all primes smaller than $m$, prove that \[\sum^{k}_{i=1} \frac{1}{p(i)} + \frac{1}{p(i)^2} > ln(ln(m)).\]

If $R_n=\frac{1}{2}(a^n+b^n)$ where $a=3+2\sqrt{2}$, $b=3-2\sqrt{2}$, and $n=0,1,2, ...,$ then $R_{12345}$ is an integer. Its units digit is $ \textbf{(A)}\ 1 \qquad\textbf{(B)}\ 3 \qquad\textbf{(C)}\ 5 \qquad\textbf{(D)}\ 7 \qquad\textbf{(E)}\ 9 $

The numbers from 1 to 1996 are written down ------ 12345678910111213.... How many zeros are written? A. 489 B. 699 C. 796 D. 996 E. None of these

For prime number $q$ the polynomial $P(x)$ with integer coefficients is said to be factorable if there exist non-constant polynomials $f_q,g_q$ with integer coefficients such that all of the coefficients of the polynomial $Q(x)=P(x)-f_q(x)g_q(x)$ are dividable by $q$ ; and we write: $$P(x)\equiv f_q(x)g_q(x)\pmod{q}$$ For example the polynomials $2x^3+2,x^2+1,x^3+1$ can be factored modulo $2,3,p$ in the following way: $$\left\{\begin{array}{lll} X^2+1\equiv (x+1)(-x+1)\pmod{2}\\ 2x^3+2\equiv (2x-1)^3\pmod{3}\\ X^3+1\equiv (x+1)(x^2-x+1) \end{array}\right.$$ Also the polynomial $x^2-2$ is not factorable modulo $p=8k\pm 3$. a) Find all prime numbers $p$ such that the polynomial $P(x)$ is factorable modulo $p$: $$P(x)=x^4-2x^3+3x^2-2x-5$$ b) Does there exist irreducible polynomial $P(x)$ in $\mathbb{Z}[x]$ with integer coefficients such that for each prime number $p$ , it is factorable modulo $p$?

Let $k,n$ and $r$ be positive integers. (a) Let $Q(x)=x^k+a_1x^{k+1}+\cdots+a_nx^{k+n}$ be a polynomial with real coefficients. Show that the function $\frac{Q(x)}{x^k}$ is strictly positive for all real $x$ satisfying $$0<|x|<\frac1{1+\sum\limits_{i=1}^n |a_i|}$$ (b) Let $P(x)=b_0+b_1x+\cdots+b_rx^r$ be a non zero polynomial with real coefficients. Let $m$ be the smallest number such that $b_m \neq 0$. Prove that the graph of $y=P(x)$ cuts the $x$-axis at the origin (i.e., $P$ changes signs at $x=0$) if and only if $m$ is an odd integer.

Compute the sum $$\sum_{k=0}^{n}\frac{(2n)!}{k!^2(n-k)!^2}.$$

Find the maximum value that the quantity $2m+7n$ can have such that there exist distinct positive integers $x_i \ (1 \leq i \leq m), y_j \ (1 \leq j \leq n)$ such that the $x_i$'s are even, the $y_j$'s are odd, and $\sum_{i=1}^{m} x_i +\sum_{j=1}^{n} y_j=1986.$

A magician intends to perform the following trick. She announces a positive integer $n$, along with $2n$ real numbers $x_1 < \dots < x_{2n}$, to the audience. A member of the audience then secretly chooses a polynomial $P(x)$ of degree $n$ with real coefficients, computes the $2n$ values $P(x_1), \dots , P(x_{2n})$, and writes down these $2n$ values on the blackboard in non-decreasing order. After that the magician announces the secret polynomial to the audience. Can the magician find a strategy to perform such a trick?

Find all polynomials $p(x)$ satisfying the condition: $$p(x^2-2x)=p(x-2)^2.$$

Determine all positive real solutions $(a,b)$ to the following system of equations. \begin{align*} \sqrt{a} + \sqrt{b} &= 6 \\ \sqrt{a-5} + \sqrt{b-5} &= 4 \end{align*}

Let $X$ be the set of all positive real numbers. Find all functions $f : X \longrightarrow X$ such that \[f (x + y) \ge f (x) + yf (f (x))\] for all $x$ and $y$ in $X$.

Brackets are to be inserted into the expression $10 \div 9 \div 8 \div 7 \div 6 \div 5 \div 4 \div 3 \div 2$ so that the resulting number is an integer. (a) Determine the maximum value of this integer. (b) Determine the minimum value of this integer.

The numbers $x, y, z, t, a$ and $b$ are positive integers, so that $xt-yz = 1$ and $$\frac{x}{y} \ge \frac{a}{b} \ge \frac{z}{t} .$$Prove that $$ab \le (x + z) (y +t)$$