Find all the polynomials with real coefficients which satisfy $ (x^2-6x+8)P(x)=(x^2+2x)P(x-2)$ for all $x\in \mathbb{R}$.

Find all the functions $ f :\mathbb{R}\mapsto\mathbb{R} $ with the following property: $ \forall x$ $f(x)= f(x/2) + (x/2)f'(x)$

An equilateral pentagon $AMNPQ$ is inscribed in triangle $ABC$ such that $M\in\overline{AB}$, $Q\in\overline{AC}$, and $N,P\in\overline{BC}$. Let $S$ be the intersection of $\overleftrightarrow{MN}$ and $\overleftrightarrow{PQ}$. Denote by $\ell$ the angle bisector of $\angle MSQ$. Prove that $\overline{OI}$ is parallel to $\ell$, where $O$ is the circumcenter of triangle $ABC$, and $I$ is the incenter of triangle $ABC$.

Let $x$ and $n$ be integers such that $1\le x\le n$. We have $x+1$ separate boxes and $n-x$ identical balls. Define $f(n,x)$ as the number of ways that the $n-x$ balls can be distributed into the $x+1$ boxes. Let $p$ be a prime number. Find the integers $n$ greater than $1$ such that the prime number $p$ is a divisor of $f(n,x)$ for all $x\in\{1,2,\ldots ,n-1\}$.

Let $x,y,z$ be nonnegative positive integers. Prove $\frac{x-y}{xy+2y+1}+\frac{y-z}{zy+2z+1}+\frac{z-x}{xz+2x+1}\ge 0$

There are 20 people at a party. Each person holds some number of coins. Every minute, each person who has at least 19 coins simultaneously gives one coin to every other person at the party. (So, it is possible that $A$ gives $B$ a coin and $B$ gives $A$ a coin at the same time.) Suppose that this process continues indefinitely. That is, for any positive integer $n$, there exists a person who will give away coins during the $n$th minute. What is the smallest number of coins that could be at the party? [i]Proposed by Ray Li[/i]

For how many paths comsisting of a sequence of horizontal and/or vertical line segments, with each segment connecting a pair of adjacent letters in the diagram below, is the word $\textup{OLYMPIADS}$ spelled out as the path is traversed from beginning to end? $\begin{tabular}{ccccccccccccccccc}& & & & & & & & O & & & & & & & &\\ & & & & & & & O & L & O & & & & & & &\\ & & & & & & O & L & Y & L & O & & & & & &\\ & & & & & O & L & Y & M & Y & L & O & & & & &\\ & & & & O & L & Y & M & P & M & Y & L & O & & & &\\ & & & O & L & Y & M & P & I & P & M & Y & L & O & & &\\ & & O & L & Y & M & P & I & A & I & P & M & Y & L & O & &\\ & O & L & Y & M & P & I & A & D & A & I & P & M & Y & L & O &\\ O & L & Y & M & P & I & A & D & S & D & A & I & P & M & Y & L & O \end{tabular}$

Real numbers $a_1,a_2,...,a_{16}$ satisfy the conditions $\sum_{i=1}^{16}a_i = 100$ and $\sum_{i=1}^{16}a_i^2 = 1000$ . What is the greatest possible value of $a_16$?

An isosceles trapezium is called [i]right[/i] if only one pair of its sides are parallel (i.e parallelograms are not right). A dissection of a rectangle into $n$ (can be different shapes) right isosceles trapeziums is called [i]strict[/i] if the union of any $i,(2\leq i \leq n)$ trapeziums in the dissection do not form a right isosceles trapezium. Prove that for any $n, n\geq 9$ there is a strict dissection of a $2017 \times 2018$ rectangle into $n$ right isosceles trapeziums. [i]Proposed by Bojan Basic[/i]

Let $p$ be a prime number. Prove that there exists a prime number $q$ such that for every integer $n$, $n^p -p$ is not divisible by $q$.

Find all positive integers $x, y, z$ such that $2^x + 21^y = z^2$

Let $P(x)$ be a nonconstant polynomial of degree $n$ with rational coefficients which can not be presented as a product of two nonconstant polynomials with rational coefficients. Prove that the number of polynomials $Q(x)$ of degree less than $n$ with rational coefficients such that $P(x)$ divides $P(Q(x))$ a) is finite b) does not exceed $n$.

Consider a computer network consisting of servers and bi-directional communication channels among them. Unfortunately, not all channels operate. Each direction of each channel fails with probability $p$ and operates otherwise. (All of these stochastic events are mutually independent, and $0 \le p \le 1$.) There is a root serve, denoted by $r$. We call the network [i]operational[/i], if all serves can reach $r$ using only operating channels. Note that we do not require $r$ to be able to reach any servers. Show that the probability of the network to be operational does not depend on the choice of $r$. (In other words, for any two distinct root servers $r_1$ and $r_2$, the operational probability is the same.)

Two congruent right circular cones each with base radius $3$ and height $8$ have axes of symmetry that intersect at right angles at a point in the interior of the cones a distance $3$ from the base of each cone. A sphere with radius $r$ lies inside both cones. The maximum possible value for $r^2$ is $\frac mn$, where $m$ and $n$ are relatively prime positive integers. Find $m+n$.

Let $AL$ and $BK$ be angle bisectors in the non-isosceles triangle $ABC$ ($L$ lies on the side $BC$, $K$ lies on the side $AC$). The perpendicular bisector of $BK$ intersects the line $AL$ at point $M$. Point $N$ lies on the line $BK$ such that $LN$ is parallel to $MK$. Prove that $LN = NA$.

Let $x_1,\ldots, x_n$ and $y_1,\ldots, y_n$ be real numbers. Let $A = (a_{ij})_{1\leq i,j\leq n}$ be the matrix with entries \[a_{ij} = \begin{cases}1,&\text{if }x_i + y_j\geq 0;\\0,&\text{if }x_i + y_j < 0.\end{cases}\] Suppose that $B$ is an $n\times n$ matrix with entries $0$, $1$ such that the sum of the elements in each row and each column of $B$ is equal to the corresponding sum for the matrix $A$. Prove that $A=B$.

Prove that if the polynomial $ f $ which is not identical to zero satisfies for every real $ x $ the equality $$ f(x)f(x + 3) = f(x^2 + x + 3), $$then it has no real roots .

A train traveling from Aytown to Beetown meets with an accident after $ 1$ hr. It is stopped for $ \frac{1}{2}$ hr., after which it proceeds at four-fifths of its usual rate, arriving at Beetown $ 2$ hr. late. If the train had covered $ 80$ miles more before the accident, it would have been just $ 1$ hr. late. The usual rate of the train is: $ \textbf{(A)}\ \text{20 mph} \qquad \textbf{(B)}\ \text{30 mph} \qquad \textbf{(C)}\ \text{40 mph} \qquad \textbf{(D)}\ \text{50 mph} \qquad \textbf{(E)}\ \text{60 mph}$

For $i=1,2,$ let $T_i$ be a triangle with side length $a_i,b_i,c_i,$ and area $A_i.$ Suppose that $a_1\le a_2, b_1\le b_2, c_1\le c_2,$ and that $T_2$ is an acute triangle. Does it follow that $A_1\le A_2$?

Determine all numbers $x, y$ and $z$ satisfying the system of equations $$\begin{cases} x^2 + yz = 1 \\ y^2 - xz = 0 \\ z^2 + xy = 1\end{cases}$$

A cube is divided into $8$ smaller cubes of the same size, as shown in the figure. Then, each of these small cubes is divided again into $8$ smaller cubes of the same size. This process is done $4$ more times to each resulting cube. What is the ratio between the sum of the total areas of all the small cubes resulting from the last division and the total area of the initial cube?

Consider all polynomials $P(x)$ with real coefficients that have the following property: for any two real numbers $x$ and $y$ one has \[|y^2-P(x)|\le 2|x|\quad\text{if and only if}\quad |x^2-P(y)|\le 2|y|.\] Determine all possible values of $P(0)$. [i]Proposed by Belgium[/i]

Let $x_1$, $x_2$, ..., $x_5$ be nonnegative real numbers such that $x_1+x_2+x_3+x_4+x_5=5$. Determine the maximum value of $x_1x_2+x_2x_3+x_3x_4+x_4x_5$.

A function $f(S)$ assigns to each nine-element subset of $S$ of the set $\{1,2,\ldots, 20\}$ a whole number from $1$ to $20$. Prove that regardless of how the function $f$ is chosen, there will be a ten-element subset $T\subset\{1,2,\ldots, 20\}$ such that $f(T - \{k\})\neq k$ for all $k\in T$.

The polynomial $P$ has integer coefficients and $P(x)=5$ for five different integers $x$. Show that there is no integer $x$ such that $-6\le P(x)\le 4$ or $6\le P(x)\le 16$.