There are $2019$ cities in the country of Balticwayland. Some pairs of cities are connected by non-intersecting bidirectional roads, each road connecting exactly 2 cities. It is known that for every pair of cities $A$ and $B$ it is possible to drive from $A$ to $B$ using at most $2$ roads. There are $62$ cops trying to catch a robber. The cops and robber all know each others’ locations at all times. Each night, the robber can choose to stay in her current city or move to a neighbouring city via a direct road. Each day, each cop has the same choice of staying or moving, and they coordinate their actions. The robber is caught if she is in the same city as a cop at any time. Prove that the cops can always catch the robber

On the sides $BC,CA$ and $AB$ of a triangle $ABC$ of area $S$ are taken points $A' ,B' ,C'$ respectively such that $AC' /AB = BA' /BC = CB' /CA = p$, where $0 < p < 1$ is variable. (a) Find the area of triangle $A' B' C'$ in terms of $ p$. (b) Find the value of $p$ which minimizes this area. (c) Find the locus of the intersection point $P$ of the lines through $A' $ and $C'$ parallel to $AB$ and $AC$ respectively.

Find all pairs of positive integers $x,y$ such that $$x^3+y^3=4(x^2y+xy^2-5).$$

Find all the functions $f(x),$ continuous on the whole real axis, such that for every real $x$ \[f(3x-2)\leq f(x)\leq f(2x-1).\] [i]Proposed by A. Golovanov[/i]

Let be a continuous function $ f:\mathbb{R}\longrightarrow\mathbb{R} $ that has the property that $$ xf(x)\ge \int_0^x f(t)dt , $$ for all real numbers $ x. $ Prove that [b]a)[/b] the mapping $ x\mapsto \frac{1}{x}\int_0^x f(t) dt $ is nondecreasing on the restrictions $ \mathbb{R}_{<0 } $ and $ \mathbb{R}_{>0 } . $ [b]b)[/b] if $ \int_x^{x+1} f(t)dt=\int_{x-1}^x f(t)dt , $ for any real number $ x, $ then $ f $ is constant. [i]Mihai Piticari[/i]

In a table consisting of $2021\times 2021$ unit squares, some unit squares are colored black in such a way that if we place a mouse in the center of any square on the table it can walk in a straight line (up, down, left or right along a column or row) and leave the table without walking on any black square (other than the initial one if it is black). What is the maximum number of squares that can be colored black?

Let $A$, $B$, $C$, $D$, $E$, $F$ be six points on a circle such that $AE\parallel BD$ and $BC\parallel DF$. Let $X$ be the reflection of the point $D$ in the line $CE$. Prove that the distance from the point $X$ to the line $EF$ equals to the distance from the point $B$ to the line $AC$.

We will call one of the cells of a rectangle 11 x 13 “[i]peculiar[/i]” , if after removing it the remaining figure can be cut into squares 2 x 2 and 3 x 3. How many of the 143 cells are “[i]peculiar[/i]”?

Let $a$ and $b$ be two positive integers. Prove that the integer \[a^2+\left\lceil\frac{4a^2}b\right\rceil\] is not a square. (Here $\lceil z\rceil$ denotes the least integer greater than or equal to $z$.) [i]Russia[/i]

Let $x,y$ be the positive real numbers with $x+y=1$, and $n$ be the positive integer with $n\ge2$. Prove that \[\frac{x^n}{x+y^3}+\frac{y^n}{x^3+y}\ge\frac{2^{4-n}}{5}\]

A convex polyhedron is floating in a sea. Can it happen that $90\%$ of its volume is below the water level, while more than half of its surface area is above the water level? (A Shapovalov)

Given $3n$ cards, each of them will be written with a number from the following sequence: $$2, 3, ..., n, n + 1, n + 3, n + 4, ..., 2n + 1, 2n + 2, 2n + 4, ..., 3n + 3$$ with each number used exactly once. Then every card is arranged from left to right in random order. Determine the probability such that for every $i$ with $1\le i \le 3n$, the number written on the $i$-th card, counted from the left, is greater than or equal to $i$.

Given $ m$ and $ n$ as relatively prime positive integers greater than one, show that \[ \frac{\log_{10} m}{\log_{10} n}\] is not a rational number.

Determine all real values of $x$ for which \[\frac{1}{\sqrt{x} + \sqrt{x - 2}} + \frac{1}{\sqrt{x} + \sqrt{x + 2}} = \frac{1}{4}.\]

a) Let $ABCD$ be a convex quadrilateral and $r_1 \le r_2 \le r_3 \le r_4$ be the radii of the incircles of triangles $ABC, BCD, CDA, DAB$. Can the inequality $r_4 > 2r_3$ hold? b) The diagonals of a convex quadrilateral $ABCD$ meet in point $E$. Let $r_1 \le r_2 \le r_3 \le r_4$ be the radii of the incircles of triangles $ABE, BCE, CDE, DAE$. Can the inequality $r_2 > 2r_1$ hold?

Given is a hexagon $ABCDEF$ with a center of symmetry. The lines $AB$ and $EF$ meet at the point $A'$, the lines $BC$ and $AF$ meet at the point $B'$, and the lines $AB$ and $CD$ meet at the point $C'$. Prove that $AB \cdot BC \cdot CD = AA' \cdot BB' \cdot CC'$.

Determine all positive integers$ n$ such that $f_n(x,y,z) = x^{2n} + y^{2n} + z^{2n} - xy - yz - zx$ divides $g_n(x,y, z) = (x - y)^{5n} + (y -z)^{5n} + (z - x)^{5n}$, as polynomials in $x, y, z$ with integer coefficients.

Given Triangle $ABC$, $\angle B= 2 \angle C$, and $\angle A>90^\circ$. Let $M$ be midpoint of $BC$. Perpendicular of $AC$ at $C$ intersects $AB$ at $D$. Show $\angle AMB = \angle DMC$ [hide]If possible, don't use projective geometry[/hide]

A plane in space is equidistant from a set of points if its distances from the points in the set are equal. What is the largest possible number of equidistant planes from five points, no four of which are coplanar?

Solve in positives $$x^y=z,y^z=x,z^x=y$$

A scanning code consists of a $7 \times 7$ grid of squares, with some of its squares colored black and the rest colored white. There must be at least one square of each color in this grid of $49$ squares. A scanning code is called [i]symmetric[/i] if its look does not change when the entire square is rotated by a multiple of $90 ^{\circ}$ counterclockwise around its center, nor when it is reflected across a line joining opposite corners or a line joining midpoints of opposite sides. What is the total number of possible symmetric scanning codes? $\textbf{(A)} \text{ 510} \qquad \textbf{(B)} \text{ 1022} \qquad \textbf{(C)} \text{ 8190} \qquad \textbf{(D)} \text{ 8192} \qquad \textbf{(E)} \text{ 65,534}$

The harmonic mean of two numbers can be calculated as twice their product divided by their sum. The harmonic mean of $1$ and $2016$ is closest to which integer? $\textbf{(A)}\ 2 \qquad \textbf{(B)}\ 45 \qquad \textbf{(C)}\ 504 \qquad \textbf{(D)}\ 1008 \qquad \textbf{(E)}\ 2015 $

Let $F$ be the set of all fractions $m/n$ where $m$ and $n$ are positive integers with $m+n\le 2005$. Find the largest number $a$ in $F$ such that $a < 16/23$.

In natural numbers $m,n$ Solve : $n(n+1)(n+2)(n+3)=m(m+1)^2(m+2)^3(m+3)^4$

Consider a polynomial $P(x) = \prod^9_{j=1}(x+d_j),$ where $d_1, d_2, \ldots d_9$ are nine distinct integers. Prove that there exists an integer $N,$ such that for all integers $x \geq N$ the number $P(x)$ is divisible by a prime number greater than 20. [i]Proposed by Luxembourg[/i]