Given an infinite sequence of numbers $a_1, a_2,...$, in which there are no two equal members. Segment $a_i, a_{i+1}, ..., a_{i+m-1}$ of this sequence is called a monotone segment of length $m$, if $a_i < a_{i+1} <...<a_{i+m-1}$ or $a_i > a_{i+1} >... > a_{i+m-1}$. It turned out that for each natural $k$ the term $a_k$ is contained in some monotonic segment of length $k + 1$. Prove that there exists a natural $N$ such that the sequence $a_N , a_{N+1} ,...$ monotonic.

A country has two capitals and several towns. Some of them are connected by roads. Some of the roads are toll roads where a fee is charged for driving along them. It is known that any route from the south capital to the north capital contains at least ten toll roads. Prove that all toll roads can be distributed among ten companies so that anybody driving from the south capital to the north capital must pay each of these companies. [i](5 points)[/i]

Let $x_i,$ $1 \leq i \leq n$ be real numbers with $n \geq 3.$ Let $p$ and $q$ be their symmetric sum of degree $1$ and $2$ respectively. Prove that: i) $p^2 \cdot \frac{n-1}{n}-2q \geq 0$ ii) $\left|x_i - \frac{p}{n}\right| \leq \sqrt{p^2 - \frac{2nq}{n-1}} \cdot \frac{n-1}{n}$ for every meaningful $i$.

It is given $2015$ numbers such that every one of them when gets replaced with sum of the rest, we get same $2015$ same numbers. Prove that product of all numbers is $0$

In a triangle $ABC$ the midpoints of $BC, CA$ and $AB$ are $D, E$ and $F$, respectively. Prove that the circumcircles of triangles $AEF, BFD$ and $CDE$ intersect all in one point.

Let $P$ be a point chosen uniformly at random in the interior of the unit square with vertices at $(0,0), (1,0), (1,1)$, and $(0,1)$. The probability that the slope of the line determined by $P$ and the point $\left(\frac58, \frac38 \right)$ is greater than $\frac12$ can be written as $\frac{m}{n}$, where $m$ and $n$ are relatively prime positive integers. Find $m+n$.

For any square matrix $\mathcal{A}$ we define $\sin {\mathcal{A}}$ by the usual power series. \[ \sin {\mathcal{A}}=\sum_{n=0}^{\infty}\frac{(-1)^n}{(2n+1)!}\mathcal{A}^{2n+1} \] Prove or disprove : $\exists 2\times 2$ matrix $A\in \mathcal{M}_2(\mathbb{R})$ such that \[ \sin{A}=\left(\begin{array}{cc}1 & 1996 \\0 & 1 \end{array}\right) \]

$(NET 1)$ The vertices of an $(n + 1)-$gon are placed on the edges of a regular $n-$gon so that the perimeter of the $n-$gon is divided into equal parts. How does one choose these $n + 1$ points in order to obtain the $(n + 1)-$gon with $(a)$ maximal area; $(b)$ minimal area?

In a triangle $ABC$ point $I$ is the incenter, $I_A$ - excenter, $W$ - midpoint of the arc $BAC$ of circumcircle $\omega$ of $ABC$. Point $H$ is the projection of $I_A$ on $IW$. The tangent line to the circumcircle $BIC$ in point $I$ intersects $\omega$ in $E, F$. Prove that the perpendicular bisector to $AI$ is tangent to the circumcircle $EFH$ [i]M. Zorka[/i]

Welcome to the [b]USAYNO[/b], where each question has a yes/no answer. Choose any subset of the following six problems to answer. If you answer $n$ problems and get them [b]all[/b] correct, you will receive $\max(0, (n-1)(n-2))$ points. If any of them are wrong (or you leave them all blank), you will receive $0$ points. Your answer should be a six-character string containing 'Y' (for yes), 'N' (for no), or 'B' (for blank). For instance if you think 1,2, and 6 are 'yes' and 3 and 4 are 'no', you should answer YYNNBY (and receive $12$ points if all five answers are correct, 0 points if any are wrong). (a) Can $1000$ queens be placed on a $2017\times2017$ chessboard such that every square is attacked by some queen? A square is attacked by a queen if it lies on the same row, column, or diagonal as the queen. (b) A $2017\times2017$ grid of squares originally contains a $0$ in each square. At any step, Kelvin the Frog choose two adjacent squares (two squares are adjacent if they share a side) and increments the numbers in both of them by $1$. Can Kelvin make every square contain a different power of $2$? (c) A [i]tournament[/i] consists of single games between every pair of players, where each game has a winner and a loser with no ties. A set of people is [i]dominated[/i] if there exists a player who beats all of them. Does there exist a tournament in which every set of $2017$ people is dominated? (d) Every cell of a $19\times19$ grid is colored either red, yellow, green, or blue. Does there necessarily exist a rectangle whose sides are parallel to the grid, all of whose vertices are the same color? (e) Does there exist a $c\in\mathbb{R}^+$ such that $\max(|A\cdot A|, |A+A|)\ge c|A|\log^2|A|$ for all finite sets $A\subset \mathbb{Z}$? (f) Can the set $\{1, 2, \dots, 1093\}$ be partitioned into $7$ subsets such that each subset is sum-free (i.e. no subset contains $a,b,c$ with $a+b=c$)? [color = red]The USAYNO disclaimer is only included in problem 33. I have included it here for convenience.[/color]

Given that $ a,b,c, x_1, x_2, ... , x_5 $ are real positives such that $ a+b+c=1 $ and $ x_1.x_2.x_3.x_4.x_5 = 1 $. Prove that \[ (ax_1^2+bx_1+c)(ax_2^2+bx_2+c)...(ax_5^2+bx_5+c)\ge 1\]

Let $ABC$ be an equilateral triangle with side length $8$, and let $D$, $E$, and $F$ be points on the sides $BC$, $CA$, and $AB$ respectively. Suppose that $BD = 2$ and $\angle ADE = \angle DEF = 60^\circ$. Calculate the length of segment $AF$.

Consider $2018$ pairwise crossing circles no three of which are concurrent. These circles subdivide the plane into regions bounded by circular $edges$ that meet at $vertices$. Notice that there are an even number of vertices on each circle. Given the circle, alternately colour the vertices on that circle red and blue. In doing so for each circle, every vertex is coloured twice- once for each of the two circle that cross at that point. If the two colours agree at a vertex, then it is assigned that colour; otherwise, it becomes yellow. Show that, if some circle contains at least $2061$ yellow points, then the vertices of some region are all yellow. Proposed by [i]India[/i]

It is given acute triangle $ABC$ with orthocenter at point $H$. Prove that $$AH \cdot h_a+BH \cdot h_b+CH \cdot h_c=\frac{a^2+b^2+c^2}{2}$$ where $a$, $b$ and $c$ are sides of a triangle, and $h_a$, $h_b$ and $h_c$ altitudes of $ABC$

Find all functions $f: \mathbb{Q^+} \rightarrow \mathbb{Q}$ satisfying $f(x)+f(y)= \left(f(x+y)+\frac{1}{x+y} \right) (1-xy+f(xy))$ for all $x, y \in \mathbb{Q^+}$.

Several tiles congruent to the one shown in the picture below are to be fit inside a $11 \times 11$ square table, with each tile covering $6$ whole unit squares, no sticking out the square and no overlapping. (a) Determine the greatest number of tiles which can be placed this way. (b) Find, with a proof, all unit squares which have to be covered in any tiling with the maximal number of tiles. [img]https://cdn.artofproblemsolving.com/attachments/c/d/23d93e9d05eab94925fc54006fe05123f0dba9.png[/img] Poland