Let $p \geq 2$ be a natural number. Prove that there exist an integer $n_0$ such that \[ \sum^{n_0}_{i=1} \frac{1}{i \cdot \sqrt[p]{i + 1}} > p. \]

You are given $n\ge 4$ positive real numbers. It turned out that all $\frac{n(n-1)}{2}$ of their pairwise products form an arithmetic progression in some order. Show that all given numbers are equal. [i](Proposed by Anton Trygub)[/i]

Let us consider every third degree polynomial $P(x)$ with coefficients as nonnegative positive integers such that $P(1)=20$. Among them determine polynomial for which is: $a)$ Minimal value of $P(4)$ $b)$ Maximal value of $P(3)/P(2)$

Let $a$ and $b$ be positive real numbers such that $3(a^2+b^2-1) = 4(a+b$). Find the minimum value of the expression $\frac{16}{a}+\frac{1}{b}$ .

Let $n$ be a positive integer. Determine the smallest value of the sum $a_1b_1+a_2b_2+...+a_{2n+2}b_{2n+2}$ where $(a_1,a_2,...,a_{2n+2})$ and $(b_1,b_2,...,b_{2n+2})$ are rearrangements of the binomial coefficients $2n+1 \choose 0$, $2n+1 \choose 1$,...,$2n+1 \choose 2n+1$. Justify your answer

The sequence $\{a_n\}$ satisfies $a_1 = \frac{1}{2}$, $a_2 = \frac{3}{8}$, and $a_{n + 1}^2 + 3 a_n a_{n + 2} = 2 a_{n + 1} (a_n + a_{n + 2}) (n \in \mathbb{N^*})$. $(1)$ Determine the general formula of the sequence $\{a_n\}$; $(2)$ Prove that for any positive integer $n$, there is $0 < a_n < \frac{1}{\sqrt{2n + 1}}$.

Let $-1 < x < 1.$ Show that \[ \sum^{6}_{k=0} \frac{1 - x^2}{1 - 2 \cdot x \cdot \cos \left( \frac{2 \cdot \pi \cdot k }{7} \right) + x^2} = \frac{7 \cdot \left( 1 + x^7 \right)}{\left( 1 - x^7 \right)}. \] Deduce that \[ \csc^2\left( x + \frac{\pi}{7} \right) + \csc^2\left(2 \cdot x + \frac{\pi}{7} \right) + \csc^2\left(3 \cdot x + \frac{\pi}{7} \right) = 8. \]

Consider the cube with the vertices at the points $(\pm 1, \pm 1, \pm 1)$. Let $V_1,...,V_{95}$ be arbitrary points within this cube. Denote $v_i = \overrightarrow{OV_i}$, where $O = (0,0,0)$ is the origin. Consider the $2^{95}$ vectors of the form $s_1v_1 + s_2v_2 +...+ s_{95}v_{95}$, where $s_i = \pm 1$. (a) If $d = 48$, prove that among these vectors there is a vector $w = (a, b, c)$ such that $a^2 + b^2 + c^2 \le 48$. (b) Find a smaller $d$ (the smaller, the better) with the same property.

Polynomial $ P(t)$ is such that for all real $ x$, \[ P(\sin x) \plus{} P(\cos x) \equal{} 1. \] What can be the degree of this polynomial?

Let $ f$ be a polynomial of degree 2 with integer coefficients. Suppose that $ f(k)$ is divisible by 5 for every integer $ k$. Prove that all coefficients of $ f$ are divisible by 5.

Let $A$ be the set of all functions $f:\mathbb{R} \to \mathbb{R}$ such that $f(xy)=xf(y)$ for all $x,y \in \mathbb{R}$. (a) If $f \in A$ then show that $f(x+y)=f(x)+f(y)$ for all $x,y \in \mathbb{R}$ (b) For $g,h \in A$, define a function $g\circ h$ by $(g \circ h)(x)=g(h(x))$ for $x \in \mathbb{R}$. Prove that $g \circ h$ is in $A$ and is equal to $h \circ g$.

$\{a_n\}$ is a positive integer sequence such that $a_{i+2} = a_{i+1} +a_i$ (for all $i \ge 1$). For positive integer $n$, define as $$b_n=\frac{1}{a_{2n+1}}\Sigma_{i=1}^{4n-2}a_i$$ Prove that $b_n$ is positive integer.

Find all $x$ for which the inequality holds $$\sqrt{7+8x-16x^2} \ge 2^{\cos^2 \pi x}+2^{\sin ^2 \pi x}$$

Find the smallest number $n$ such that there exist polynomials $f_1, f_2, \ldots , f_n$ with rational coefficients satisfying \[x^2+7 = f_1\left(x\right)^2 + f_2\left(x\right)^2 + \ldots + f_n\left(x\right)^2.\] [i]Proposed by Mariusz Skałba, Poland[/i]

Let $ S$ be a finite set of points in the plane such that no three of them are on a line. For each convex polygon $ P$ whose vertices are in $ S$, let $ a(P)$ be the number of vertices of $ P$, and let $ b(P)$ be the number of points of $ S$ which are outside $ P$. A line segment, a point, and the empty set are considered as convex polygons of $ 2$, $ 1$, and $ 0$ vertices respectively. Prove that for every real number $ x$ \[\sum_{P}{x^{a(P)}(1 \minus{} x)^{b(P)}} \equal{} 1,\] where the sum is taken over all convex polygons with vertices in $ S$. [i]Alternative formulation[/i]: Let $ M$ be a finite point set in the plane and no three points are collinear. A subset $ A$ of $ M$ will be called round if its elements is the set of vertices of a convex $ A \minus{}$gon $ V(A).$ For each round subset let $ r(A)$ be the number of points from $ M$ which are exterior from the convex $ A \minus{}$gon $ V(A).$ Subsets with $ 0,1$ and 2 elements are always round, its corresponding polygons are the empty set, a point or a segment, respectively (for which all other points that are not vertices of the polygon are exterior). For each round subset $ A$ of $ M$ construct the polynomial \[ P_A(x) \equal{} x^{|A|}(1 \minus{} x)^{r(A)}. \] Show that the sum of polynomials for all round subsets is exactly the polynomial $ P(x) \equal{} 1.$ [i]Proposed by Federico Ardila, Colombia[/i]

For any positive integer $ x$ define $ g(x)$ as greatest odd divisor of $ x,$ and \[ f(x) \equal{} \begin{cases} \frac {x}{2} \plus{} \frac {x}{g(x)} & \text{if \ \(x\) is even}, \\ 2^{\frac {x \plus{} 1}{2}} & \text{if \ \(x\) is odd}. \end{cases} \] Construct the sequence $ x_1 \equal{} 1, x_{n \plus{} 1} \equal{} f(x_n).$ Show that the number 1992 appears in this sequence, determine the least $ n$ such that $ x_n \equal{} 1992,$ and determine whether $ n$ is unique.

For real variables $0 \leq x, y, z, w \leq 1$, find the maximum value of $$x(1-y)+2y(1-z)+3z(1-w)+4w(1-x)$$

The quadratic polynomials $f$ and $g$ with real coefficients are such that if $g(x)$ is an integer for some $x>0$, then so is $f(x)$. Prove that there exist integers $m,n$ such that $f(x)=mg(x)+n$ for all $x$.

Find all functions $f : R \to R$ that satisfy $f(x + y^2 - f(y)) = f(x)$ for all $x,y \in R$. (Vo Quoc Ba Can)

Show that a triangle whose angles $A$, $B$, $C$ satisfy the equality \[ \frac{\sin^2 A + \sin^2 B + \sin^2 C}{\cos^2 A + \cos^2 B + \cos^2 C} = 2 \] is a rectangular triangle.

For a positive integer $n$, denote $c_n=2017^n$. A function $f: \mathbb{N} \rightarrow \mathbb{R}$ satisfies the following two conditions. 1. For all positive integers $m, n$, $f(m+n) \le 2017 \cdot f(m) \cdot f(n+325)$. 2. For all positive integer $n$, we have $0<f(c_{n+1})<f(c_n)^{2017}$. Prove that there exists a sequence $a_1, a_2, \cdots $ which satisfies the following. For all $n, k$ which satisfies $a_k<n$, we have $f(n)^{c_k} < f(c_k)^n$.

A calculator can square a number or add $1$ to it. It cannot add $1$ two times in a row. By several operations it transformed a number $x$ into a number $S > x^n + 1$ ($x, n,S$ are positive integers). Prove that $S > x^n + x - 1$.

What is the smallest possible value of $x^2 + y^2 - x -y - xy$?

If a polynomial $P$ with integer coefficients has three distinct integer zeroes , then show that $P(n)\neq 1$ for any integer $n$.

Given two positive real numbers $a$ and $b$, suppose that a mapping $f : \mathbb R^+ \to \mathbb R^+$ satisfies the functional equation \[f(f(x)) + af(x) = b(a + b)x.\] Prove that there exists a unique solution of this equation.