In a triangle $ABC$, let $I$ denote its incenter. Points $D, E, F$ are chosen on the segments $BC, CA, AB$, respectively, such that $BD + BF = AC$ and $CD + CE = AB$. The circumcircles of triangles $AEF, BFD, CDE$ intersect lines $AI, BI, CI$, respectively, at points $K, L, M$ (different from $A, B, C$), respectively. Prove that $K, L, M, I$ are concyclic.

Five identical circles are placed in a line inside a larger one as shown. If the shown chord has length $16,$ find the radius of the large circle.

The figure below consists of several unit squares, $M$ of which are white and $N$ of which are green. Compute $100M+N$. [asy] size(4cm); int N = 4; path square; for (int x=-N; x<=N; ++x) { for (int y=-N+abs(x); y<=N-abs(x); ++y) { square = rotate(9)*((x+0.5,y+0.5)--(x+0.5,y-0.5)--(x-0.5,y-0.5)--(x-0.5,y+0.5)--cycle); if ((x+y) % 2 == 0) { filldraw(square, green, black); } else { filldraw(square, white, black); } } } [/asy] [i]Proposed by Evan Chen[/i]

It is given sequence wih length of $2017$ which consists of first $2017$ positive integers in arbitrary order (every number occus exactly once). Let us consider a first term from sequence, let it be $k$. From given sequence we form a new sequence of length 2017, such that first $k$ elements of new sequence are same as first $k$ elements of original sequence, but in reverse order while other elements stay unchanged. Prove that if we continue transforming a sequence, eventually we will have sequence with first element $1$.

Points $P$ and $Q$ are chosen uniformly and independently at random on sides $\overline {AB}$ and $\overline{AC},$ respectively, of equilateral triangle $\triangle ABC.$ Which of the following intervals contains the probability that the area of $\triangle APQ$ is less than half the area of $\triangle ABC?$ $\textbf{(A) } \left[\frac 38, \frac 12\right] \qquad \textbf{(B) } \left(\frac 12, \frac 23\right] \qquad \textbf{(C) } \left(\frac 23, \frac 34\right] \qquad \textbf{(D) } \left(\frac 34, \frac 78\right] \qquad \textbf{(E) } \left(\frac 78, 1\right]$

Let $ \varphi(x)$ be a cubic polynomial with integer coefficients. Given that $ \varphi(x)$ has have 3 distinct real roots $u,v,w $ and $u,v,w $ are not rational number. there are integers $ a, b,c$ such that $u=av^2+bv+c$. Prove that $b^2 -2b -4ac - 7$ is a square number .

Given an arbitrary triangle $ ABC$, denote by $ P,Q,R$ the intersections of the incircle with sides $ BC, CA, AB$ respectively. Let the area of triangle $ ABC$ be $ T$, and its perimeter $ L$. Prove that the inequality \[\left(\frac {AB}{PQ}\right)^3 \plus{}\left(\frac {BC}{QR}\right)^3 \plus{}\left(\frac {CA}{RP}\right)^3 \geq \frac {2}{\sqrt {3}} \cdot \frac {L^2}{T}\] holds.

Let $ P$ be a point inside a triangle $ ABC$ such that \[ \angle APB \minus{} \angle ACB \equal{} \angle APC \minus{} \angle ABC. \] Let $ D$, $ E$ be the incenters of triangles $ APB$, $ APC$, respectively. Show that the lines $ AP$, $ BD$, $ CE$ meet at a point.

Let $a$ and $b$ be real numbers satisfying $a>b>0$. Evaluate \[\int_0^{2\pi}\dfrac{1}{a+b\cos(\theta)}d\theta.\] Express your answer in terms of $a$ and $b$.

What is the smallest possible value of $\left|12^m-5^n\right|$, where $m$ and $n$ are positive integers?

If $m, n$, and $p$ are three different natural numbers, each between $2$ and $9$, what then are all the possible integer value(s) of the expression $\frac{m+n+p}{m+n}$?

[b]Problem 1[/b] Let $f : \mathbb{R} \rightarrow \mathbb{R}$ be differentiable on $\mathbb{R}$. Prove that there exists $x \in [0, 1]$ such that $$\frac{4}{\pi} ( f(1) - f(0) ) = (1+x^2) f'(x) \ .$$

Peter and Basil take turns drawing roads on a plane, Peter starts. The road is either horizontal or a vertical line along which one can drive in only one direction (that direction is determined when the road is drawn). Can Basil always act in such a way that after each of his moves one could drive according to the rules between any two constructed crossroads, regardless of Peter's actions? Alexandr Perepechko

Suppose that $n^2-2m^2=m(n+3)-3$. Find all integers $m$ such that all corresponding solutions for $n$ will [i]not[/i] be real.

Carl chooses a [i]functional expression[/i]* $E$ which is a finite nonempty string formed from a set $x_1, x_2, \dots$ of variables and applications of a function $f$, together with addition, subtraction, multiplication (but not division), and fixed real constants. He then considers the equation $E = 0$, and lets $S$ denote the set of functions $f \colon \mathbb R \to \mathbb R$ such that the equation holds for any choices of real numbers $x_1, x_2, \dots$. (For example, if Carl chooses the functional equation $$ f(2f(x_1)+x_2) - 2f(x_1)-x_2 = 0, $$ then $S$ consists of one function, the identity function. (a) Let $X$ denote the set of functions with domain $\mathbb R$ and image exactly $\mathbb Z$. Show that Carl can choose his functional equation such that $S$ is nonempty but $S \subseteq X$. (b) Can Carl choose his functional equation such that $|S|=1$ and $S \subseteq X$? *These can be defined formally in the following way: the set of functional expressions is the minimal one (by inclusion) such that (i) any fixed real constant is a functional expression, (ii) for any positive integer $i$, the variable $x_i$ is a functional expression, and (iii) if $V$ and $W$ are functional expressions, then so are $f(V)$, $V+W$, $V-W$, and $V \cdot W$. [i]Proposed by Carl Schildkraut[/i]

Find all functions $f:\mathbb R \to \mathbb R$ such that for all $x,y\in \mathbb R$ $f(x+f(y))=2x+2f(y+1)$

The polynomial $$x^{10} + ?x^9 + ?x^8 + ... + ?x + 1$$ is written on the blackboard. Two players substitute (real) numbers instead of one of the question marks in turn. ($9$ turns total.) The first wins if the polynomial will have no real roots. Who wins?

A right parallelepiped (i.e. a parallelepiped one of whose edges is perpendicular to a face) is given. Its vertices have integral coordinates, and no other points with integral coordinates lie on its faces or edges. Prove that the volume of this parallelepiped is a sum of three perfect squares. [i]Proposed by A. Golovanov[/i]

Prove that for each $m\geq1$: \[\sum_{|k|<\sqrt m}\binom{2m}{m+k}\geq 2^{2m-1}\] [hide="Hint"]Maybe probabilistic method works[/hide]

Find all positive integers $x,y,z$ with $z$ odd, which satisfy the equation: $$2018^x=100^y + 1918^z$$

Let $ G$ be a simple graph with vertex set $ V\equal{}\{0,1,2,3,\cdots ,n\plus{}1\}$ .$ j$and$ j\plus{}1$ are connected by an edge for $ 0\le j\le n$. Let $ A$ be a subset of $ V$ and $ G(A)$ be the induced subgraph associated with $ A$. Let $ O(G(A))$ be number of components of $ G(A)$ having an odd number of vertices. Let $ T(p,r)\equal{}\{A\subset V \mid 0.n\plus{}1 \notin A,|A|\equal{}p,O(G(A))\equal{}2r\}$ for $ r\le p \le 2r$. Prove That $ |T(p,r)|\equal{}{n\minus{}r \choose{p\minus{}r}}{n\minus{}p\plus{}1 \choose{2r\minus{}p}}$.

The incircle $\omega$ of a triangle $ABC$ touches the sides $BC, AC, AB$ in the points $D, E, F$ respectively. Two different points $K$ and $L$ are chosen in $\omega$ such that $\angle CKE+\angle BKF=\angle CLE+\angle BLF=180^{\circ}$. Prove that the line $KL$ is in the same distance to the point $D, E,$ and $F$.

In $\triangle JMT$, $JM=410$, $JT=49$, and $\angle{MJT}>90^\circ$. Let $I$ and $H$ be the incenter and orthocenter of $\triangle JMT$, respectively. The circumcircle of $\triangle JIH$ intersects $\overleftrightarrow{JT}$ at a point $P\neq J$, and $IH=HP$. Find $MT$.

Let $k$ and $n$ be integers with $1\leq k<n$. Alice and Bob play a game with $k$ pegs in a line of $n$ holes. At the beginning of the game, the pegs occupy the $k$ leftmost holes. A legal move consists of moving a single peg to any vacant hole that is further to the right. The players alternate moves, with Alice playing first. The game ends when the pegs are in the $k$ rightmost holes, so whoever is next to play cannot move and therefore loses. For what values of $n$ and $k$ does Alice have a winning strategy?

Let $n \geq 2$ be an integer. Consider an $n\times n$ chessboard with the usual chessboard colouring. A move consists of choosing a $1\times 1$ square and switching the colour of all squares in its row and column (including the chosen square itself). For which $n$ is it possible to get a monochrome chessboard after a finite sequence of moves?