In a mathematical challenge, positive real numbers $a_{1}\geq a_{2} \geq ... \geq a_{n}$ and an initial sequence of positive real numbers $(b_{1}, b_{2},...,b_{n+1})$ are given to Secco. Let $C$ a non-negative real number. In a sequence $(x_{1},x_{2},...,x_{n+1})$, consider the following operation: Subtract $1$ of some $x_{j}$, $j \in \{1,2,...,n+1\}$, add $C$ to $x_{n+1}$ and replace $(x_{1},x_{2},...,x_{j-1})$ for $(x_{1}+a_{\sigma (1)}, x_{2}+a_{\sigma (2)}, ..., x_{j-1}+a_{\sigma (j-1)})$, where $\sigma$ is a permutation of $(1,2,...,j-1)$. Secco's goal is to make all terms of sequence $(b_{k})$ negative after a finite number of operations. Find all values of $C$, depending of $a_{1}, a_{2},..., a_{n}, b_{1}, b_{2}, ..., b_{n+1}$, for which Secco can attain his goal.

Quadrilateral $ABCD$ is cyclic. Line through point $D$ parallel with line $BC$ intersects $CA$ in point $P$, line $AB$ in point $Q$ and circumcircle of $ABCD$ in point $R$. Line through point $D$ parallel with line $AB$ intersects $AC$ in point $S$, line $BC$ in point $T$ and circumcircle of $ABCD$ in point $U$. If $PQ=QR$, prove that $ST=TU$

Find the limit \[\lim_{n\to\infty} \frac{1}{n\ln n}\int_{\pi}^{(n+1)\pi} (\sin ^ 2 t)(\ln t)\ dt.\]

We consider the infinite chessboard covering the whole plane. In every field of the chessboard there is a nonnegative real number. Every number is the arithmetic mean of the numbers in the four adjacent fields of the chessboard. Prove that the numbers occurring in the fields of the chessboard are all equal.

In the space, three lines $a,b,c$ that any two in them are skew lines. Then the number of lines that intersect all of $a,b,c$ is $\text{(A)}0\qquad\text{(B)}1\qquad\text{(C)}\text{more than one, but finitely many}\qquad\text{(D)} \text{infinitely many}$

Let $A$, $B$, and $C$ be three points such that $B$ is the midpoint of segment $AC$ and let $P$ be a point such that $<PBC=60$. Equilateral triangle $PCQ$ is constructed such that $B$ and $Q$ are on different half=planes with respect to $PC$, and the equilateral triangle $APR$ is constructed in such a way that $B$ and $R$ are in the same half-plane with respect to $AP$. Let $X$ be the point of intersection of the lines $BQ$ and $PC$, and let $Y$ be the point of intersection of the lines $BR$ and $AP$. Prove that $XY$ and $AC$ are parallel.

A fair six-sided die is rolled five times. The probability that the five die rolls form an increasing sequence where each value is strictly larger than the one that preceded can be written in the form $m/n$ , where $m$ and $n$ are relatively prime positive integers. Compute $m + n$.

For real number $a,$ find the minimum value of $\int_{0}^{\frac{\pi}{2}}\left|\frac{\sin 2x}{1+\sin^{2}x}-a\cos x\right| dx.$

Let $ ABC $ a triangle, and $ P\neq B,C $ be a point situated upon the segment $ BC $ such that $ ABP $ and $ APC $ have the same perimeter. $ M $ represents the middle of $ BC, $ and $ I, $ the center of the incircle of $ ABC. $ Prove that $ IM\parallel AP. $

Let $a,b,c$ be non-zero real numbers.Prove that if function $f,g:\mathbb{R}\to\mathbb{R}$ satisfy $af(x+y)+bf(x-y)=cf(x)+g(y)$ for all real number $x,y$ that $y>2018$ then there exists a function $h:\mathbb{R}\to\mathbb{R}$ such that $f(x+y)+f(x-y)=2f(x)+h(y)$ for all real number $x,y$.

Show that in any triangle $ABC$ with $A = 90^0$ the following inequality holds: $$(AB -AC)^2(BC^2 + 4AB \cdot AC)^2 \le 2BC^6$$

Given four points $ A_1, A_2, A_3, A_4$ in the plane, no three collinear, such that \[ A_1A_2 \cdot A_3 A_4 \equal{} A_1 A_3 \cdot A_2 A_4 \equal{} A_1 A_4 \cdot A_2 A_3, \] denote by $ O_i$ the circumcenter of $ \triangle A_j A_k A_l$ with $ \{i,j,k,l\} \equal{} \{1,2,3,4\}.$ Assuming $ \forall i A_i \neq O_i ,$ prove that the four lines $ A_iO_i$ are concurrent or parallel. [i]Nikolai Ivanov Beluhov, Bulgaria[/i]

How many solutions does the equation $a ! = b ! c !$ have where $a$, $b$, $c$ are integers greater than $1$? $ \textbf{(A)}\ 1 \qquad\textbf{(B)}\ 2 \qquad\textbf{(C)}\ 6 \qquad\textbf{(D)}\ 8 \qquad\textbf{(E)}\ \text{Infinitely many} $

Four mutually externally tangent spherical apples of radius $4$ are placed on a horizontal flat table. Then, a spherical orange of radius $3$ is placed such that it rests on all the apples. Find the distance from the center of the orange to the table.

On a sheet divided into squares, each square measuring $2cm$, two circles are drawn such that both circles are inscribed in a square as in the figure below. Determine the minimum distance between the two circles.

Two straight lines divide a square of side length $1$ into four regions. Show that at least one of the regions has a perimeter greater than or equal to $2$. [i]Proposed by Dylan Toh[/i]

Call a positive integer [i]convenient[/i] if its digits can be partitioned into two collections of contiguous digits whose element sums are $7$ and $11$. For example, $3456$ is convenient, but $4247$ is not. Compute the number of convenient positive integers less than or equal to $10^5$.

Mr. DoBa has a bag of markers. There are 2 blue, 3 red, 4 green, and 5 yellow markers. Mr. DoBa randomly takes out two markers from the bag. The probability that these two markers are different colors can be expressed as $\frac{m}{n}$ for relatively prime positive integers $m$ and $n$. Compute $m+n$. [i]Proposed by Raina Yang[/i]

Find all prime numbers $a,b,c$ and positive integers $k$ satisfying the equation \[a^2+b^2+16c^2 = 9k^2 + 1.\] Proposed by Moldova

Consider coins with positive real denominations not exceeding 1. Find the smallest $C>0$ such that the following holds: if we have any $100$ such coins with total value $50$, then we can always split them into two stacks of $50$ coins each such that the absolute difference between the total values of the two stacks is at most $C$. [i]Merlijn Staps[/i]

Three lines passing through point $ O$ form equal angles by pairs. Points $ A_1$, $ A_2$ on the first line and $ B_1$, $ B_2$ on the second line are such that the common point $ C_1$ of $ A_1B_1$ and $ A_2B_2$ lies on the third line. Let $ C_2$ be the common point of $ A_1B_2$ and $ A_2B_1$. Prove that angle $ C_1OC_2$ is right.

A midpoint plotter is an instrument which draws the exact mid point of two point previously drawn. Starting off two points $1$ unit of distance apart and using only the midpoint plotter, you have to get two point which are strictly at a distance between $\frac{1}{2017}$ and $\frac{1}{2016}$ units, drawing the minimum amount of points. ¿Which is the minimum number of times you will need to use the midpoint plotter and what strategy should you follow to achieve it?

Let $r$ be a positive integer and let $N$ be the smallest positive integer such that the numbers $\frac{N}{n+r}\binom{2n}{n}$, $n=0,1,2,\ldots $, are all integer. Show that $N=\frac{r}{2}\binom{2r}{r}$.

We are given a certain number of identical sets of weights; each set consists of four different weights expressed by natural numbers (of weight units). Using these weights we are able to weigh out every integer mass up to $1985$ (inclusive). How many ways are there to compose such a set of weight sets given that the joint mass of all weights is the least possible?

For any triple $(a, b, c)$ of positive integers, not all equal, We are given sufficiently many rectangular blocks of size $a \times b \times c$. We use these blocks to fill up a cubic box of edge $10$. (a) Assume we have used at least $100$ blocks. Show that there are two blocks, one of which is a translate of the other. (b) Find a number smaller than $100$ (the smaller, the better) for which the above statement still holds.