Suppose $P(x)$ is a quadratic polynomial with integer coefficients satisfying the identity \[P(P(x)) - P(x)^2 = x^2+x+2016\] for all real $x$. What is $P(1)$?

Let $P(z)=a_d z^d+\dots+ a_1z+a_0$ be a polynomial with complex coefficients. The $reverse$ of $P$ is defined by $$P^*(z)=\overline{a_0}z^d+\overline{a_1}z^{d-1}+\dots+\overline{a_d}$$ (a) Prove that $$P^*(z)=z^d \overline{ P\left( \frac{1}{\overline{z}} \right) } $$ (b) Let $m$ be a positive integer and let $q(z)$ be a monic nonconstant polynomial with complex coefficients. Suppose that all roots of $q(z)$ lie inside or on the unit circle. Prove that all roots of the polynomial $$Q(z)=z^m q(z)+ q^*(z)$$ lie on the unit circle.

Determine all integers $x$ satisfying \[ \left[\frac{x}{2}\right] \left[\frac{x}{3}\right] \left[\frac{x}{4}\right] = x^2. \] ($[y]$ is the largest integer which is not larger than $y.$)

In triangle $ABC$, points $D, E$, and $F$ intersect one-third of the respective sides. Show that the sum of the areas of the three gray triangles is equal to the area of middle triangle. [img]https://1.bp.blogspot.com/-KWrhwMHXfDk/XzcIkhWnK5I/AAAAAAAAMYk/Tj6-PnvTy9ksHgke8cDlAjsj2u421Xa9QCLcBGAsYHQ/s0/1993%2BMohr%2Bp4.png[/img]

(a) Consider a $6 \times 6$ board with two squares removed at diagonally opposite corners. Prove that it is not possible to exactly cover it with $2 \times 1$ dominoes. (b) Consider a box with dimensions $4 \times 4 \times 4$ from which two $1 \times 1 \times 1$ cubes have been removed at diagonally opposite corners. Is it possible to fill the remaining space exactly with bricks of dimensions $2 \times 1 \times 1$?

The integers from $1$ to $999999$ are partitioned into two groups: the first group consists of those integers for which the closest perfect square is odd, whereas the second group consists of those for which the closest perfect square is even. In which group is the sum of the elements greater?

Points $A,B,C$are chosen inside the triangle $ A_{1}B_{1}C_{1},$ so that the quadrilaterals $B_{1}CBC_{1}, C_{1}ACA_{1}$ and $A_{1}BAB_{1}$ are inscribed in the circles $\Omega _{A}, \Omega _{B}$ and $\Omega _{C},$ respectively. The circle $Y_{A}$ internally touches the circles $\Omega _{B}, \Omega _{C}$ and externally touches the circle $\Omega _{A}.$ The common interior tangent to the circles $Y_{A}$ and $\Omega _{A}$ intersects the line $BC$ at point $A'.$ Points $B'$ and $C'$ are analogously defined. Prove that points $A',B'$ and $C'$ are lying on the same line.

$ABC$ is a triangle with $\angle A = 90^o$. For a point $D$ on the side $BC$, the feet of the perpendiculars to $AB$ and $AC$ are $E$ and$ F$. For which point $D$ is $ EF$ a minimum?

A function $f: Z \to Z$ has the following properties: $f (92 + x) = f (92 - x)$ $f (19 \cdot 92 + x) = f (19 \cdot 92 - x)$ ($19 \cdot 92 = 1748$) $f (1992 + x) = f (1992 - x)$ for all integers $x$. Can all positive divisors of $92$ occur as values of f?

Find the number of ordered pairs $(a,b)$ such that $a,b \in \{10,11,\cdots,29,30\}$ and \\ $\hspace{1cm}$ $GCD(a,b)+LCM(a,b)=a+b$.

Given an $m$-element set $M$ and a $k$-element subset $K \subset M$. We call a function $f: K \to M$ has "path", if there exists an element $x_0 \in K$ such that $f(x_0) = x_0$, or there exists a chain $x_0, x_1, \ldots, x_j = x_0 \in K$ such that $_xi = f(x_{i-1})$ for $i = 1, 2, \ldots, j$. Find the number of functions $f: K \to M$ which have path.

In a soccer tournament between four teams, $A$, $B$, $C$, and $D$, each team plays each of the others exactly once. a) Decide if, at the end of the tournament, it is possible for the quantities of goals scored and goals allowed for each team to be as follows: $\begin{tabular}{ c|c|c|c|c } {} & A & B & C & D \\ \hline Goals scored & 1 & 3 & 6 & 7 \\ \hline Goals allowed & 4 & 4 & 4 & 5 \\ \end{tabular}$ If the answer is yes, give an example for the results of the six games; in the contrary, justify your answer. b) Decide if, at the end of the tournament, it is possible for the quantities of goals scored and goals allowed for each team to be as follows: $\begin{tabular}{ c|c|c|c|c } {} & A & B & C & D \\ \hline Goals scored & 1 & 3 & 6 & 13 \\ \hline Goals allowed & 4 & 4 & 4 & 11 \\ \end{tabular}$ If the answer is yes, give an example for the results of the six games; in the contrary, justify your answer.

On Monday, Millie puts a quart of seeds, $ 25\%$ of which are millet, into a bird feeder. On each successive day she adds another quart of the same mix of seeds without removing any seeds that are left. Each day the birds eat only $ 25\%$ of the millet in the feeder, but they eat all of the other seeds. On which day, just after Millie has placed the seeds, will the birds find that more than half the seeds in the feeder are millet? $ \textbf{(A)}\ \text{Tuesday}\qquad \textbf{(B)}\ \text{Wednesday}\qquad \textbf{(C)}\ \text{Thursday} \qquad \textbf{(D)}\ \text{Friday}\qquad \textbf{(E)}\ \text{Saturday}$

Let $n>3$ be a positive integer. Equilateral triangle ABC is divided into $n^2$ smaller congruent equilateral triangles (with sides parallel to its sides). Let $m$ be the number of rhombuses that contain two small equilateral triangles and $d$ the number of rhombuses that contain eight small equilateral triangles. Find the difference $m-d$ in terms of $n$.

Let $x, y,$ and $N$ be real numbers, with $y$ nonzero, such that the sets $\{(x+y)^2, (x-y)^2, xy, x/y\}$ and $\{4, 12.8, 28.8, N\}$ are equal. Compute the sum of the possible values of $N.$

Does there exist a sequence of positive integers $a_1,a_2,...$ such that every positive integer occurs exactly once and that the number $\tau (na_{n+1}^n+(n+1)a_n^{n+1})$ is divisible by $n$ for all positive integer. Here $\tau (n)$ denotes the number of positive divisor of $n$.

In $p{}$ of the vertices of the regular polygon $A_0A_1\ldots A_{2016}$ we write the number $1{}$ and in the remaining ones we write the number $-1.{}$ Let $x_i{}$ be the number written on the vertex $A_i{}.$ A vertex is [i]good[/i] if \[x_i+x_{i+1}+\cdots+x_j>0\quad\text{and}\quad x_i+x_{i-1}+\cdots+x_k>0,\]for any integers $j{}$ and $k{}$ such that $k\leqslant i\leqslant j.$ Note that the indices are taken modulo $2017.$ Determine the greatest possible value of $p{}$ such that, regardless of numbering, there always exists a good vertex.

Let $n$ be an odd integer greater than $1.$ Let $A$ be an $n\times n$ symmetric matrix such that each row and column consists of some permutation of the integers $1,2, \ldots, n.$ Show that each of the integers $1,2, \ldots, n$ must appear in the main diagonal of $A$.

Find the area of quadrilateral $ABCD$ if: two opposite angles are right;two sides which form right angle are of equal length and sum of lengths of other two sides is $10$

A table with 1000 cards on a line, numbered from 1 to 1000, is considered. The cards are ordered in the usual way. Now, we proceed in the following way. The first card (which is 1) is put just before the last card (between 999 and 1000) and, after, the new first card (which is 2) is put after the last card (which was 1000). Show that after 1000 movements, the cards are ordered again in the usual way. Show that the analogous result ($n$ movements for $n$ cards) does not hold when $n$ is odd.

Given a sequence $x_1,x_2,...,x_n$ of real numbers with ${x_{n + 1}}^3 = {x_n}^3 - 3{x_n}^2 + 3{x_n}$, where $(n=1,2,3,...)$. What must be value of $x_1$, so that $x_{100}$ and $x_{1000}$ becomes equal?

Let $a_n$ be the number of such numbers $N$: sum of all digits of $N$ is $n$, and each digit can only be $1,3,4$. Prove that $a_{2n}$ is a perfect square for all $n\in\mathbb{Z}_+$.

Can the numbers from 1 to 81 be written in a 9×9 board, so that the sum of numbers in each 3×3 square is the same? [i]S. Tokarev[/i]

Given that \[34! = 95232799cd96041408476186096435ab000000_{(10)},\] determine the digits $a, b, c$, and $d$.

All the internal phone numbers in a certain company have four digits. The director wants the phone numbers of the administration offices to consist of digits $ 1$, $ 2$, $ 3$ only, and that any of these phone numbers coincide in at most one position. What is the maximum number of distinct phone numbers that these offices can have ?