Let $P(x)$ be a quadratic polynomial with two distinct real roots. For all real numbers $a$ and $b$ satisfying $|a|,|b| \ge 2017$, we have $P(a^2+b^2) \ge P(2ab)$. Show that at least one of the roots of $P$ is negative.

On the sides $ BC $, $ CA $, $ AB $ of the triangle $ ABC $, the points $ M $, $ N $, $ P $ are taken, respectively, in such a way that $$\frac{BM}{MC} = \frac{CN}{NA} = \frac{AP}{PB} = k, $$ where $ k $ means a given number greater than $ 1 $, then the segments $ AM $, $ BN $, $ CP $ were drawn . Given the area $ S $ of the triangle $ ABC $, calculate the area of the triangle bounded by the lines $ AM $, $ BN $ and $ CP $.

Prove that if you choose $10^{100}$ points on a circle and arrange numbers from $1$ to $10^{100}$ on them in some order, then you can choose $100$ pairwise disjoint chords with ends at the selected points such that the sums of the numbers at the ends of all of them are equal to each other.

How many ways are there to arrange the numbers $1$, $2$, $3$, $4$, $5$, $6$ on the vertices of a regular hexagon such that exactly 3 of the numbers are larger than both of their neighbors? Rotations and reflections are considered the same.

Let $P_1P_2...P_n$ be a regular $n$-gon in the plane and $a_1, . . . , a_n$ be nonnegative integers. It is possible to draw $m$ circles so that for each $1 \le i \le n$, there are exactly $a_i$ circles that contain $P_i$ on their interior. Find, with proof, the minimum possible value of $m$ in terms of the $a_i$. .

Let ${{\left( {{a}_{n}} \right)}_{n\ge 1}}$ an increasing sequence and bounded.Calculate $\underset{n\to \infty }{\mathop{\lim }}\,\left( 2{{a}_{n}}-{{a}_{1}}-{{a}_{2}} \right)\left( 2{{a}_{n}}-{{a}_{2}}-{{a}_{3}} \right)...\left( 2{{a}_{n}}-{{a}_{n-2}}-{{a}_{n-1}} \right)\left( 2{{a}_{n}}-{{a}_{n-1}}-{{a}_{1}} \right).$

Let $ M,N $ be points on the segments $ AB,AC, $ respectively, of the triangle $ ABC. $ Also, let $ P,Q, $ be the midpoints of the segments $ MN,BC, $ respectively. Knowing that $ PQ $ is parallel to the bisector of $ \angle BAC , $ show that $ BM=CN. $ [i]Gheorghe Duță[/i]

A coloring of all plane points with coordinates belonging to the set $S=\{0,1,\ldots,99\}$ into red and white colors is said to be [i]critical[/i] if for each $i,j\in S$ at least one of the four points $(i,j),(i + 1,j),(i,j + 1)$ and $(i + 1, j + 1)$ $(99 + 1\equiv0)$ is colored red. Find the maximal possible number of red points in a critical coloring which loses its property after recoloring of any red point into white.

Given regular $1976$-gon. The midpoints of all the sides and diagonals are marked. What is the greatest number of the marked points lying on one circumference?

Let $O$ be the circumcenter of a triangle $\vartriangle ABC$. It is given that $\angle ABC = 70^o$, $\angle ACB =50^o$. Let the angle bisector of $\angle BAC$ intersect the circumcircle of $\vartriangle ABC$ again at $D$. Compute $\angle ADO$.

Vincent is playing a game with Evil Bill. The game uses an infinite number of red balls, an infinite number of green balls, and a very large bag. Vincent first picks two nonnegative integers $g$ and $k$ such that $g < k \le 2016$, and Evil Bill places $g$ green balls and $2016 - g$ red balls in the bag, so that there is a total of $2016$ balls in the bag. Vincent then picks a ball of either color and places it in the bag. Evil Bill then inspects the bag. If the ratio of green balls to total balls in the bag is ever exactly $\frac{k}{2016}$ , then Evil Bill wins. If the ratio of green balls to total balls is greater than $\frac{k}{2016}$ , then Vincent wins. Otherwise, Vincent and Evil Bill repeat the previous two actions (Vincent picks a ball and Evil Bill inspects the bag). If $S$ is the sum of all possible values of $k$ that Vincent could choose and be able to win, determine the largest prime factor of $S$.

Let $a,b,c$ be elements of finite order in some group. Prove that if $a^{-1}ba=b^2$, $b^{-2}cb^2=c^2$, and $c^{-3}ac^3=a^2$ then $a=b=c=e$, where $e$ is the unit element.

The spectators are seated in a row with no empty places. Each is in a seat which does not match the spectator's ticket. An usher can order two spectators in adjacent seats to trade places unless one of them is already seated correctly. Is it true that from any initial arrangement, the spectators can be brought to their correct seats?

Compute the value of $$\sin^2 20^{\circ} + \cos^2 50^{\circ} + \sin 20^{\circ} \cos 50^{\circ}.$$ [i](Source: China National High School Mathematics League 2021, Zhejiang Province, Problem 2)[/i]

Compute the product of the three smallest prime factors of \[21!\cdot 14!+21!\cdot 21+14!\cdot 14+21\cdot 14.\] [i]Proposed by Daniel Liu

When Ann meets new people, she tries to find out who is acquainted with who. In order to memorize it she draws a circle in which each person is depicted by a chord; moreover, chords corresponding to acquainted persons intersect (possibly at the ends), while the chords corresponding to non-acquainted persons do not. Ann believes that such set of chords exists for any company. Is her judgement correct? (5)

Jason starts in a cell of the grid below. Every second he moves to an adjacent cell (i.e., two cells that share a side) that he has not visited yet. Find the maximum possible number of cells that Jason can visit. [asy] size(3cm); draw((1,0)--(4,0)); draw((0,1)--(5,1)); draw((0,2)--(5,2)); draw((0,3)--(5,3)); draw((0,4)--(5,4)); draw((1,5)--(4,5)); draw((0,1)--(0,4)); draw((1,0)--(1,5)); draw((2,0)--(2,5)); draw((3,0)--(3,5)); draw((4,0)--(4,5)); draw((5,1)--(5,4)); [/asy]

Let $ ABCD$ be convex quadrilateral with $ \angle C\equal{}\angle D\equal{}90{}^\circ$. The circle $ K$ passing through $ A$ and $ B$ is tangent to $ CD$ at $ C$. Let $ E$ be the intersection of $ K$ and $ \left[AD\right]$. If $ \left|BC\right|\equal{}20$, $ \left|AD\right|\equal{}16$, then $ \left|CE\right|$ is $\textbf{(A)}\ 9 \qquad\textbf{(B)}\ 6\sqrt{2} \qquad\textbf{(C)}\ 4\sqrt{5} \qquad\textbf{(D)}\ 7\sqrt{2} \qquad\textbf{(E)}\ 10$

A point in the plane, both of whose rectangular coordinates are integers with absolute values less than or equal to four, is chosen at random, with all such points having an equal probability of being chosen. What is the probability that the distance from the point to the origin is at most two units? $\textbf{(A) }\frac{13}{81}\qquad\textbf{(B) }\frac{15}{81}\qquad\textbf{(C) }\frac{13}{64}\qquad\textbf{(D) }\frac{\pi}{16}\qquad \textbf{(E) }\text{the square of a rational number}$

For each $n\in\mathbb N$, the function $f_n$ is defined on real numbers $x\ge n$ by $$f_n(x)=\sqrt{x-n}+\sqrt{x-n+1}+\ldots+\sqrt{x+n}-(2n+1)\sqrt x.$$(a) If $n$ is fixed, prove that $\lim_{x\to+\infty}f_n(x)=0$. (b) Find the limit of $f_n(n)$ as $n\to+\infty$.

A system of equations $$\begin{cases} x^2 \,\, ? \,\, z^2 = -8 \\ y^2 \,\, ? \,\, z^2 = 7 \end{cases}$$ is written on a piece of paper, but unfortunately two of the symbols are a little blurred. However, it is known that the system has at least one solution, and that each of the two question marks stands for either $+$ or $-$. What are the two symbols?

A toymaker has $k$ dice at his disposal, each with $6$ blank sides. On each side of each of these dice, the toymaker must draw one of the digits $0, 1, 2, \ldots , 9$. Determine (in terms of $k$) the largest integer $n$ such that the toymaker can draw digits on the $k$ dice such that, for any positive integer $r \leq n$, it is possible to choose some of the $k$ dice and form with them the decimal representation of $r$. [b]Note:[/b] The digits 6 and 9 are distinguishable: they appear as [u]6[/u] and [u]9[/u].

We consider an $n \times n$ table, with $n\ge1$. Aya wishes to color $k$ cells of this table so that that there is a unique way to place $n$ tokens on colored squares without two tokens are not in the same row or column. What is the maximum value of $k$ for which Aya's wish is achievable?

Let $ \vartheta_1,...,\vartheta_n$ be independent, uniformly distributed, random variables in the unit interval $ [0,1]$. Define \[ h(x)\equal{} \frac1n \# \{k: \; \vartheta_k<x\ \}.\] Prove that the probability that there is an $ x_0 \in (0,1)$ such that $ h(x_0)\equal{}x_0$, is equal to $ 1\minus{} \frac1n.$ [i]G. Tusnady[/i]

Let $f$ be any function that maps the set of real numbers into the set of real numbers. Prove that there exist real numbers $x$ and $y$ such that \[f\left(x-f(y)\right)>yf(x)+x\] [i]Proposed by Igor Voronovich, Belarus[/i]