In quadrilateral $ ABCD$, $ AB \equal{} 5$, $ BC \equal{} 17$, $ CD \equal{} 5$, $ DA \equal{} 9$, and $ BD$ is an integer. What is $ BD$? [asy]unitsize(4mm); defaultpen(linewidth(.8pt)+fontsize(8pt)); dotfactor=4; pair C=(0,0), B=(17,0); pair D=intersectionpoints(Circle(C,5),Circle(B,13))[0]; pair A=intersectionpoints(Circle(D,9),Circle(B,5))[0]; pair[] dotted={A,B,C,D}; draw(D--A--B--C--D--B); dot(dotted); label("$D$",D,NW); label("$C$",C,W); label("$B$",B,E); label("$A$",A,NE);[/asy]$ \textbf{(A)}\ 11 \qquad \textbf{(B)}\ 12 \qquad \textbf{(C)}\ 13 \qquad \textbf{(D)}\ 14 \qquad \textbf{(E)}\ 15$

Show that for any non-negative real numbers $a,b,c,d$ such that $a^2+b^2+c^2+d^2=1$ the following inequality hold: $$a+b+c+d-1\geq 16abcd$$ When does equality hold?

Find all integers $n\geq 2$ for which there exist the real numbers $a_k, 1\leq k \leq n$, which are satisfying the following conditions: \[\sum_{k=1}^n a_k=0, \sum_{k=1}^n a_k^2=1 \text{ and } \sqrt{n}\cdot \Bigr(\sum_{k=1}^n a_k^3\Bigr)=2(b\sqrt{n}-1), \text{ where } b=\max_{1\leq k\leq n} \{a_k\}.\]

If $x$ and $y$ are positive reals, prove that $$x^2\sqrt{\frac{x}{y}}+y^2\sqrt{\frac{y}{x}} \geq x^2+y^2$$

Let $a$ and $b$ be natural numbers. We consider the set $M$ of the points of the plane with an integer $x$-coordinate from $1$ to $a$ and integer $y$-coordinate from $1$ to $b$. For two points $P = (x, y)$ and $Q = (\tilde x, \tilde y)$ in M we write $P\le Q$ if $x\le \tilde x$ and $y \le \tilde y$, we say $P$ is [i]less [/i] than $Q$ when $P\le Q$ and $P \ne Q$. A subset $S$ of $M$ is now called [i]cute [/i] if for every point $P \in S$ it also contains all smaller points. From an arbitrary subset $S$ of $M$ we can now create new subsets in four ways to construct: (a) the complement $K (S) = \overline{S}$, (b) the subset $\min (S)$ of its minima, i.e. those points for which there is no smaller in $S$ occurs, (c) the cute set $P (S)$ of all those points in M that are less than or equal to some point are from $S$, (d) you do all these things one after the other and get a set $Z (S) = P (\min (K (S)))$. Let $S$ be cute. Prove that $$\underset{a+b\,\, times\,\, Z}{Z(Z(...(Z(S))...))=S}$$

Let $a<b<c<d$ be positive integers which satisfy $ad=bc.$ Prove that $2a+\sqrt{a}+\sqrt{d}<b+c+1.$ [i]Marius Mînea[/i]

[b]a)[/b] Among the $21$ pairwise distances between the $7$ points of the plane, prove that one and the same number occurs not more than $12$ times. [b]b)[/b] Find a maximum number of times may meet the same number among the $15$ pairwise distances between $6$ points of the plane.

Prove that $c=10\sqrt{24}$ is the largest constant such that if there exist positive numbers $a_1,a_2,\ldots ,a_{17}$ satisfying: \[\sum_{i=1}^{17}a_i^2=24,\ \sum_{i=1}^{17}a_i^3+\sum_{i=1}^{17}a_i<c \] then for every $i,j,k$ such that $1\le 1<j<k\le 17$, we have that $x_i,x_j,x_k$ are sides of a triangle.

$x$, $y$, and $z$ are real numbers such that $xyz=10$. What is the maximum possible value of $x^3y^3z^3-3x^4-12y^2-12z^4$?

Show that the inequality \[\sum_{i=1}^n \sum_{j=1}^n \sqrt{|x_i-x_j|}\leqslant \sum_{i=1}^n \sum_{j=1}^n \sqrt{|x_i+x_j|}\]holds for all real numbers $x_1,\ldots x_n.$

Let $a_n, b_n$ be sequences of positive reals such that,$$a_{n+1}= a_n + \frac{1}{2b_n}$$ $$b_{n+1}= b_n + \frac{1}{2a_n}$$ for all $n\in\mathbb N$. Prove that, $\text{max}\left(a_{2018}, b_{2018}\right) >44$.

Real numbers $b>a>0$ are given. Find the number $r$ in $[a,b]$ which minimizes the value of $\max\left\{\left|\frac{r-x}x\right||a\le x\le b\right\}$.

Find the smallest positive number $\lambda $ , such that for any complex numbers ${z_1},{z_2},{z_3}\in\{z\in C\big| |z|<1\}$ ,if $z_1+z_2+z_3=0$, then $$\left|z_1z_2 +z_2z_3+z_3z_1\right|^2+\left|z_1z_2z_3\right|^2 <\lambda .$$

Let $x,y,z$ represent the side lengths of any triangle, and $s=\dfrac{x+y+z}{2}$ and the area of this triangle be $\sqrt{s}$ square units. Prove that $$s\Big(\frac{1}{x(s-x)^2}+\frac{1}{y(s-y)^2}+\frac{1}{z(s-z)^ 2} \Big)\ge \frac{1}{2} \Big(\frac{1}{s-x}+\frac{1}{s-y}+\frac{1}{s-z}\Big)$$ [i](Zhuge Liang)[/i]

If $a_{1}$, $a_{2}$, $\ldots$, $a_{n}\geq 0$ are such that \[a_{1}^{2}+\cdots+a_{n}^{2}=1,\] then find the maximum value of the product $(1-a_{1})\cdots (1-a_{n})$.

Let $a, b>0$. Prove that:$$ (a^3+b^3+a^3b^3)(\frac{1}{a^3} + \frac{1}{b^3} + \frac{1}{a^3b^3} ) +27 \ge 6(a+b+\frac{1}{a} +\frac{1}{b} +\frac{a}{b} +\frac{b}{a}) $$

Let $a,b,c,d$ be positive real numbers such that $abcd=1$. Prove that \[ \frac{1+ab}{1+a} + \frac{1+bc}{1+b} + \frac{1+cd}{1+c} + \frac{1+da}{1+d} \geq 4 . \] [i]Proposed by A. Khrabrov[/i]

Two families of parallel lines are given in the plane, consisting of $15$ and $11$ lines, respectively. In each family, any two neighboring lines are at a unit distance from one another; the lines of the first family are perpendicular to the lines of the second family. Let $V$ be the set of $165$ intersection points of the lines under consideration. Show that there exist not fewer than $1986$ distinct squares with vertices in the set $V .$

Prove that if positive reals $x,y$ satisfy $x+y= 3$, $x,y \ge 1$ then $$9(x- 1)(y- 1) + (y^2 + y+ 1)(x + 1) + (x^2-x+ 1)(y- 1) \ge 9$$

Let $u_1, u_2, \dots, u_{2019}$ be real numbers satisfying \[u_{1}+u_{2}+\cdots+u_{2019}=0 \quad \text { and } \quad u_{1}^{2}+u_{2}^{2}+\cdots+u_{2019}^{2}=1.\] Let $a=\min \left(u_{1}, u_{2}, \ldots, u_{2019}\right)$ and $b=\max \left(u_{1}, u_{2}, \ldots, u_{2019}\right)$. Prove that \[ a b \leqslant-\frac{1}{2019}. \]

In each cell of a table with $m$ rows and $n$ columns, where $m<n$, we put a non-negative real number such that each column contains at least one positive number. Show that there is a cell with a positive number such that the sum of the numbers in its row is larger than the sum of the numbers in its column.

Let $k\ge 2$ be an integer and let $a_1 ,a_2 ,\cdots ,a_n,b_1 ,b_2 ,\cdots ,b_n$ be non-negative real numbers. Prove that\[\left(\frac{n}{n-1}\right)^{n-1}\left(\frac{1}{n} \sum_{i\equal{}1}^{n} a_i^2\right)+\left(\frac{1}{n} \sum_{i\equal{}1}^{n} b_i\right)^2\ge\prod_{i=1}^{n}(a_i^{2}+b_i^{2})^{\frac{1}{n}}.\]

Solve a set of inequalities in the domain of integer numbers: $$3x^2 +2yz \le 1+y^2$$ $$3y^2 +2zx \le 1+z^2$$ $$3z^2 +2xy \le 1+x^2$$

Show that there are positive reals $a$, $b$, $c$ such that \[\left\{ \begin{array}{l} a^2 + b^2 + c^2 > 2 \\ a^3 + b^3 + c^3 <2 \\ a^4 + b^4 + c^4 > 2 \\ \end{array} \right. \]

Let $a, b$ and $c$ be natural numbers. Determine the smallest value that the following expression can take: $$\frac{a}{gcd\,\,(a + b, a - c)} + \frac{b}{gcd\,\,(b + c, b - a)} + \frac{c}{gcd\,\,(c + a, c - b)}.$$ . Remark: $gcd \,\, (6, 0) = 6$ and $gcd\,\,(3, -6) = 3$.