Let $a_0,a_1,a_2,\dots $ be a sequence of real numbers such that $a_0=0, a_1=1,$ and for every $n\geq 2$ there exists $1 \leq k \leq n$ satisfying \[ a_n=\frac{a_{n-1}+\dots + a_{n-k}}{k}. \]Find the maximum possible value of $a_{2018}-a_{2017}$.

Determine all the triples $(a, b, c)$ of positive real numbers such that the system \[ax + by -cz = 0,\]\[a \sqrt{1-x^2}+b \sqrt{1-y^2}-c \sqrt{1-z^2}=0,\] is compatible in the set of real numbers, and then find all its real solutions.

Fix positive integers $n$ and $k$, and $2n$ positive (not neccesarily distinct) real numbers $a_1,\cdots, a_n$, $b_1, \cdots, b_n$. An equation is written on a whiteboard: $$t=*\times*\times\cdots\times*$$ where $t$ is a fixed positive real number, with exactly $k$ asterisks. Ebi fills each asterisk with a number from $a_1, a_2,\cdots, a_n$, while Rubi fills each asterisk with a number from $b_1, b_2,\cdots, b_n$, so that the equation on the whiteboard is correct. Suppose for every positive real number $t$, the number of ways for Ebi and Rubi to do so are equal. Prove that the sequences $a_1,\cdots, a_n$ and $b_1, \cdots, b_n$ are permutations of each other. [i](Note: $t=a_1a_2a_3$ and $t=a_2a_3a_1$ are considered different ways to fill the asterisks, and the chosen terms need not be distinct, for example $t=a_1a_1a_2$.)[/i] [i]Proposed by Wong Jer Ren[/i]

Given a sequence $\{x_k\}$ such that $x_1 = 1$, $x_{n+1} = n \sin x_n+ 1$. Prove that the sequence is non-periodic.

Let $P(x)$ be a polynomial of degree $n$ such that $P(x)=Q(x)P^{\prime\prime}(x)$, where $Q(x)$ is a quadratic polynomial and $P^{\prime\prime}(x)$ is the second derivative of $P(x)$. Show that if $P(x)$ has at least two distinct roots then it must have $n$ distinct roots.

Calamitous Clod deceives the math beasts by changing a clock at Beast Academy. First, he removes both the minute and hour hands, then places each of them back in a random position, chosen uniformly along the circle. Professor Grok notices that the clock is not displaying a valid time. That is, the hour and minute hands are pointing in an orientation that a real clock would never display. One such example is the hour hand pointed at $6$ and the minute hand pointed at $3$. [center] [asy] import olympiad; size(4cm); defaultpen(fontsize(8pt)); draw(circle(origin, 4)); dot(origin); for(int i = 1; i <= 12; ++i){ label("$"+string(i)+"$", (3.6*sin(i * pi/6), 3.6*cos(i * pi/6))); } draw(origin -- (3.2, 0), EndArrow(5)); draw(origin -- (0, -2.2), EndArrow(5)); [/asy] [/center] The math beasts can fix this, though. They can turn both hands by the same number of degrees clockwise. On average, what is the minimal number of degrees they must turn the hands so that they display a valid time?

We define a sequence $a_n$ so that $a_0=1$ and \[a_{n+1} = \begin{cases} \displaystyle \frac{a_n}2 & \textrm { if } a_n \equiv 0 \pmod 2, \\ a_n + d & \textrm{ otherwise. } \end{cases} \] for all postive integers $n$. Find all positive integers $d$ such that there is some positive integer $i$ for which $a_i=1$.

A polynomial $w$ of degree $n > 1$ has $n$ distinct zeros $x_1,x_2,...,x_n$. Prove that: $$\frac{1}{w'(x_1)}+\frac{1}{w'(x_2)}+...···+\frac{1}{w'(x_n)}= 0.$$

Suppose that $x$ and $y$ are real numbers that satisfy the system of equations $2^x-2^y=1$ $4^x-4^y=\frac{5}{3}$ Determine $x-y$

Determine all the integers solutions $(x,y)$ of the following equation $$\frac{x^2-4}{2x-1}+\frac{y^2-4}{2y-1}=x+y$$

Let $P$ be a polynomial with integer coefficients. We say $P$ is [i]good [/i] if there exist infinitely many prime numbers $q$ such that the set $$X=\left\{P(n) \mod q : \quad n\in \mathbb N\right\}$$ has at least $\frac{q+1}{2}$ members. Prove that the polynomial $x^3+x$ is good.

find all polynomials with integer coefficients that $P(\mathbb{Z})= ${$p(a):a\in \mathbb{Z}$} has a Geometric progression.

Prove that if $a$ and $b$ are positive integers and $ab>1$, then \[\left\lfloor\frac{(a-b)^2-1}{ab}\right\rfloor=\left\lfloor\frac{(a-b)^2-1}{ab-1}\right\rfloor.\]Here $\lfloor x\rfloor$ denotes the greatest integer not exceeding $x$. [i]Calvin Deng.[/i]

Let $\left \{ c_i \right \}_{i=0}^{\infty}$ be a sequence of non-negative real numbers with $c_{2017}>0$. A sequence of polynomials is defined as $$P_{-1}(x)=0 \ , \ P_0(x)=1 \ , \ P_{n+1}(x)=xP_n(x)+c_nP_{n-1}(x).$$ Prove that there doesn't exist any integer $n>2017$ and some real number $c$ such that $$P_{2n}(x)=P_n(x^2+c).$$ [i]Proposed by Navid Safaei[/i]

A sequence $(a_n)_0^N$ of real numbers is called concave if $2a_n\ge a_{n-1} + a_{n+1}$ for all integers $n, 1 \le n \le N - 1$. $(a)$ Prove that there exists a constant $C >0$ such that \[\left(\displaystyle\sum_{n=0}^{N}a_n\right)^2\ge C(N - 1)\displaystyle\sum_{n=0}^{N}a_n^2\:\:\:\:\:(1)\] for all concave positive sequences $(a_n)^N_0$ $(b)$ Prove that $(1)$ holds with $C = \frac{3}{4}$ and that this constant is best possible.

Let function $f : \mathbb Z_{\geq 0}^0 \to \mathbb N$ satisfy the following conditions: (i) $ f(0, 0, 0) = 1;$ (ii) $f(x, y, z) = f(x - 1, y, z) + f(x, y - 1, z) + f(x, y, z - 1);$ (iii) when applying above relation iteratively, if any of $x', y', z$' is negative, then $f(x', y', z') = 0.$ Prove that if $x, y, z$ are the side lengths of a triangle, then $\frac{\left(f(x,y,z) \right) ^k}{ f(mx ,my, mz)}$ is not an integer for any integers $k, m > 1.$

Prove that for any positive real $x$ and $y$, holds the inequality $$\frac{1}{(x+y)^2}+\frac{1}{x^2}+\frac{1}{y^2} \ge \frac{9}{4xy}$$

Determine all triples $(x,y,z)$ of real numbers that satisfy all of the following three equations: $$\begin{cases} \lfloor x \rfloor + \{y\} =z \\ \lfloor y \rfloor + \{z\} =x \\ \lfloor z \rfloor + \{x\} =y \end{cases}$$

The sequence of real numbers $(a_n)_{n\geq 0}$ is such that $a_0 = 1$, $a_1 = a > 2$ and $\displaystyle a_{n+1} = \left(\left(\frac{a_n}{a_{n-1}}\right)^2 -2\right)a_n$ for every positive integer $n$. Prove that $\displaystyle \sum_{i=0}^k \frac{1}{a_i} < \frac{2+a-\sqrt{a^2-4}}{2}$ for every positive integer $k$.

A polynomial $ f(x)\equal{}x^3\plus{}ax^2\plus{}bx\plus{}c$ is such that $ b<0$ and $ ab\equal{}9c$. Prove that the polynomial $ f$ has three different real roots.

Real numbers $x,y,z$ satisfy $$\frac{1}{x}+\frac{1}{y}+\frac{1}{z}+x+y+z=0$$ and none of them lies in the open interval $(-1,1)$. Find the maximum value of $x+y+z$. [i]Proposed by Jaromír Šimša[/i]

Positive integers $x, y$ satisfy the following conditions: $$\{\sqrt{x^2 + 2y}\}> \frac{2}{3}; \hspace{10mm} \{\sqrt{y^2 + 2x}\}> \frac{2}{3}$$ Show that $x = y$. Here $\{x\}$ denotes the fractional part of $x$. For example, $\{3.14\} = 0.14$. [i]Proposed by Anton Trygub[/i]

We define a sequence with $a_1=850$ and $$a_{n+1}=\frac{a_n^2}{a_n-1}$$ for $n\geq 1$. Find all values of $n$ for which $\lfloor a_n\rfloor =2024$.

Let $a>0$, the function $f: (0,+\infty) \to R$ satisfies $f(a)=1$, if for any positive reals $x$ and $y$, there is \[f(x)f(y)+f \left( \frac{a}{x}\right)f \left( \frac{a}{y}\right) =2f(xy)\] then prove that $f(x)$ is a constant.

Find all polynomials $P(x, y)$ with real coefficients which for all real numbers $x$ and $y$ satisfy $P(x + y, x - y) = 2P(x, y)$.