Let $ P $ be a point on the side $ AB $ of the triangle $ ABC. $ The parallels through $ P $ of the medians $ AA_1,BB_1 $ intersect $ BC,AC $ at $ R,Q, $ respectively. Show that $ P, $ the middlepoint of $ RQ $ and the centroid of $ ABC $ are collinear.

The altitudes $AN$ and $BM$ are drawn in triangle $ABC$. Prove that the perpendicular bisector to the segment $NM$ divides the segment $AB$ in half.

Let $ ABCD$ be a trapezoid with $ AB\parallel{}CD$, $ AB\equal{}11$, $ BC\equal{}5$, $ CD\equal{}19$, and $ DA\equal{}7$. Bisectors of $ \angle A$ and $ \angle D$ meet at $ P$, and bisectors of $ \angle B$ and $ \angle C$ meet at $ Q$. What is the area of hexagon $ ABQCDP$? $ \textbf{(A)}\ 28\sqrt{3}\qquad \textbf{(B)}\ 30\sqrt{3}\qquad \textbf{(C)}\ 32\sqrt{3}\qquad \textbf{(D)}\ 35\sqrt{3}\qquad \textbf{(E)}\ 36\sqrt{3}$

Recall that the conjugate of the complex number $w = a + bi$, where $a$ and $b$ are real numbers and $i = \sqrt{-1}$, is the complex number $\overline{w} = a - bi$. For any complex number $z$, let $f(z) = 4i\hspace{1pt}\overline{z}$. The polynomial $P(z) = z^4 + 4z^3 + 3z^2 + 2z + 1$ has four complex roots: $z_1$, $z_2$, $z_3$, and $z_4$. Let $Q(z) = z^4 + Az^3 + Bz^2 + Cz + D$ be the polynomial whose roots are $f(z_1)$, $f(z_2)$, $f(z_3)$, and $f(z_4)$, where the coefficients $A,$ $B,$ $C,$ and $D$ are complex numbers. What is $B + D?$ $(\textbf{A})\: {-}304\qquad(\textbf{B}) \: {-}208\qquad(\textbf{C}) \: 12i\qquad(\textbf{D}) \: 208\qquad(\textbf{E}) \: 304$

There are 81 grid points (uniformly spaced) in the square shown in the diagram below, including the points on the edges. Point $P$ is the center of the square. Given that point $Q$ is randomly chosen from among the other 80 points, what is the probability that line $PQ$ is a line of symmetry for the square? [asy] size(130); defaultpen(fontsize(11)); int i, j; for(i=0; i<9; i=i+1) { for(j=0; j<9; j=j+1) if((i==4) && (j==4)) { dot((i,j),linewidth(5)); } else { dot((i,j),linewidth(3)); } } dot("$P$",(4,4),NE); draw((0,0)--(0,8)--(8,8)--(8,0)--cycle); [/asy] $\textbf{(A) } \frac{1}{5} \qquad\textbf{(B) } \frac{1}{4} \qquad\textbf{(C) } \frac{2}{5} \qquad\textbf{(D) } \frac{9}{20} \qquad\textbf{(E) } \frac{1}{2}$

Let $ a \in \mathbb{R}, 0 < a < 1,$ and $ f$ a continuous function on $ [0, 1]$ satisfying $ f(0) \equal{} 0, f(1) \equal{} 1,$ and \[ f \left( \frac{x\plus{}y}{2} \right) \equal{} (1\minus{}a) f(x) \plus{} a f(y) \quad \forall x,y \in [0,1] \text{ with } x \leq y.\] Determine $ f \left( \frac{1}{7} \right).$

For a positive integer $n$, let $p(n)$ denote the product of the digits of $n$, and let $s(n)$ denote the sum of the digits of $n$. Find the sum of all positive integers $n$ satisfying $p(n)s(n)=8$.

Consider arrangements of the numbers $1$ through $64$ on the squares of an $8\times 8$ chess board, where each square contains exactly one number and each number appears exactly once. A number in such an arrangement is called super-plus-good, if it is the largest number in its row and at the same time the smallest number in its column. Prove or disprove each of the following statements: (a) Each such arrangement contains at least one super-plus-good number. (b) Each such arrangement contains at most one super-plus-good number. Proposed by Gerhard J. Woeginger

Let $m$ and $n$ be positive integers. A people planted two kind of different trees on a plot tabular grid size $ m \times n $ (each square plant one tree.) A plant called [i]inpressive[/i] if two conditions following conditions are met simultaneously: i) The number of trees in each of kind is equal; ii) In each row the number of tree of each kind is diffrenent not less than a half of number of cells on that row and In each colum the number of tree of each kind is diffrenent not less than a half of number of cells on that colum. a) Find an inpressive plant when $m=n=2016$; b) Prove that if there at least a inpressive plant then $4|m$ and $4|n$.

Fix positive integers $m$ and $n$. Suppose that $a_1, a_2, \dots, a_m$ are reals, and that pairwise distinct vectors $v_1, \dots, v_m\in \mathbb{R}^n$ satisfy $$\sum_{j\neq i} a_j \frac{v_j-v_i}{||v_j-v_i||^3}=0$$ for $i=1,2,\dots,m$. Prove that $$\sum_{1\le i<j\le m} \frac{a_ia_j}{||v_j-v_i||}=0.$$

In $ \bigtriangleup ABC $, $ AB = 86 $, and $ AC = 97 $. A circle with center $ A $ and radius $ AB $ intersects $ \overline{BC} $ at points $ B $ and $ X $. Moreover $ \overline{BX} $ and $ \overline{CX} $ have integer lengths. What is $ BC $? $ \textbf{(A)} \ 11 \qquad \textbf{(B)} \ 28 \qquad \textbf{(C)} \ 33 \qquad \textbf{(D)} \ 61 \qquad \textbf{(E)} \ 72 $

The square was cut into $n^2$ rectangles with sides $a_i \times b_j, i , j= 1,..., n$. For what is the smallest $n$ in the set $\{a_1, b_1, ..., a_n, b_n\}$ all the numbers can be different?

Find all continious $f: \mathbb R\longrightarrow\mathbb R$ that for any $x,y$ \[f(x)+f(y)+f(xy)=f(x+y+xy)\]

Martin and Chayo have an bag with $2016$ chocolates each one. Both empty his bag on a table making a pile of chocolates. They decide to make a competence to see who gets the chocolates, as follows: A movement consist that a player take two chocolates of his pile, keep a chocolate in his bag and put the other chocolate in the pile of the other player, in his turn the player needs to make at least one movement and he can repeat as many times as he wish before passing his turn. Lost the player that can not make at least one movement in his turn. If Martin starts the game, who can ensure the victory and keep all the chocolates?

In triangle $ABC$, the altitude $AH$ passes through midpoint of the median $BM$. Prove that in the triangle $BMC$ also one of the altitudes passes through the midpoint of one of the medians.

Points $E, F, G$ lie, and on the sides $BC, CA, AB$, respectively of a triangle $ABC$, with $2AG=GB, 2BE=EC$ and $2CF=FA$. Points $P$ and $Q$ lie on segments $EG$ and $FG$, respectively such that $2EP = PG$ and $2GQ=QF$. Prove that the quadrilateral $AGPQ$ is a parallelogram.