A triangle $\vartriangle ABC$ is situated on the plane and a point $E$ is given on segment $AC$. Let $D$ be a point in the plane such that lines $AD$ and $BE$ are parallel. Suppose that $\angle EBC = 25^o$, $\angle BCA = 32^o$, and $\angle CAB = 60^o$. Find the smallest possible value of $\angle DAB$ in degrees.

In a $9\times 9$ table, all cells contain zeros. The following operations can be performed on the table: 1. Choose an arbitrary row, add one to all the numbers in that row, and shift all these numbers one cell to the right (and place the last number in the first position). 2. Choose an arbitrary column, subtract one from all its numbers, and shift all these numbers one cell down (and place the bottommost number in the top cell). Is it possible to obtain a table in which all cells, except two, contain zeros, with 1 in the bottom-left cell and -1 in the top-right cell after several such operations? [i]Proposed by N. Vlasova[/i]

In the plane a line $l$ and a point $A$ outside it are given. Find the locus of the incenters of acute-angled triangles having a vertex $A$ and an opposite side lying on $l$.

10.5 Let $BB'$, $CC'$ be the altitudes of an acute triangle $ABC$. Two circles through $A$ and $C'$ are tangent to $BC$ at points $P$ and $Q$. Prove that $A, B', P, Q$ are concyclic.

Evaluate \[\frac{2005\displaystyle \int_0^{1002}\frac{dx}{\sqrt{1002^2-x^2}+\sqrt{1003^2-x^2}}+\int_{1002}^{1003}\sqrt{1003^2-x^2}dx}{\displaystyle \int_0^1\sqrt{1-x^2}dx}\]

Find the set of all quadruplets $(x,y, z,w)$ of non-zero real numbers which satisfy $$1 +\frac{1}{x}+\frac{2(x + 1)}{xy}+\frac{3(x + 1)(y + 2)}{xyz}+\frac{4(x + 1)(y + 2)(z + 3)}{xyzw}= 0$$

Determine all functionf $f : \mathbb{R} \mapsto \mathbb{R}$ such that \[ f(x+y) = f(x)f(y) - c \sin{x} \sin{y} \] for all reals $x,y$ where $c> 1$ is a given constant.

You are given a set of $n$ blocks, each weighing at least $1$; their total weight is $2n$. Prove that for every real number $r$ with $0 \leq r \leq 2n-2$ you can choose a subset of the blocks whose total weight is at least $r$ but at most $r + 2$.

What is the maximum number of points that can be placed in the interior of an equilateral triangle of side length $2$ such that the distance between any two points is greater than one? $\text{(A) }3\qquad\text{(B) }4\qquad\text{(C) }5\qquad\text{(D) }6\qquad\text{(E) }7$

Find all pairs $ (m, n) $ of natural numbers such that $ n ^ 4 \ | \ 2m ^ 5 - 1 $ and $ m ^ 4 \ | \ 2n ^ 5 + 1 $.

How many ordered pairs of integers $(x, y)$ satisfy the equation$$x^{2020}+y^2=2y?$$ $\textbf{(A) } 1 \qquad\textbf{(B) } 2 \qquad\textbf{(C) } 3 \qquad\textbf{(D) } 4 \qquad\textbf{(E) } \text{infinitely many}$

Determine the position of a normal chord of a parabola such that it cuts off of the parabola a segment of minimum area.

Let $P_i (x_i, y_i)$ (with $i = 1, 2, 3, 4, 5$) be five points with integer coordinates, no three collinear. Show that among all triangles with vertices at these points, at least three have integer areas.

Let $\alpha$ and $\beta$ be positive rational numbers so that $\alpha+\beta\sqrt{5}$ is a root of some polynomial $x^2+ax+b$ where $a$ and $b$ are integers. What is the smallest possible value of $\alpha\beta$?

Does the Cauchy problem $u|_{y=x^2}=1$, $(\nabla u)^2=1$ have a smooth solution in the domain $y\ge x^2$? In the domain $y\le x^2$?

Let $\omega$ be the circumcircle of a triangle $ABC$. Denote by $M$ and $N$ the midpoints of the sides $AB$ and $AC$, respectively, and denote by $T$ the midpoint of the arc $BC$ of $\omega$ not containing $A$. The circumcircles of the triangles $AMT$ and $ANT$ intersect the perpendicular bisectors of $AC$ and $AB$ at points $X$ and $Y$, respectively; assume that $X$ and $Y$ lie inside the triangle $ABC$. The lines $MN$ and $XY$ intersect at $K$. Prove that $KA=KT$.

Determine all functions $f:\mathbb R\to\mathbb R$ such that equality $$f(x + y + yf(x)) = f(x) + f(y) + xf(y)$$ holds for all real numbers $x$, $y$. Proposed by Athanasios Kontogeorgis

Let $A$ be a set of $n$ non-negative integers. We say it has property $\mathcal P$ if the set $\{x + y \mid x, y \in A\}$ has $\binom{n}{2}$ elements. We call the largest element of $A$ minus the smallest element, the diameter of $A$. Let $f(n)$ be the smallest diameter of any set $A$ with property $\mathcal P$. Show that $n^2 \leq 4 f(n) < 4 n^3$. [hide="Comment"](If you have some amount of time, try a best estimative for $f(n)$, such that $f(p)<2p^2$ for prime $p$).[/hide]

$K, L, M$ and $N$ are points on sides $AB, BC, CD$ and $DA$, respectively, of the unit square $ABCD$ such that $KM$ is parallel to $BC$ and $LN$ is parallel to $AB$. The perimeter of triangle $KLB$ is equal to $1$. What is the area of triangle $MND$?

Determine the functions $f:(0,\pi)\to\mathbb R$ which satisfy $$f'(x)=\frac{\cos2020x}{\sin x}$$ for any real $x\in(0,\pi)$. [i]Proposed by D.M. Bătinețu-Giurgiu and Neculai Stanciu[/i]

Factor the polynomial $P (x) = 1 + x +x^2+...+x^{2^k-1}$

Let $S$ be a finite set of rational numbers. For each positive integer $k$, let $b_k=0$ if we can select $k$ (not necessarily distinct) numbers in $S$ whose sum is $0$, and $b_k=1$ otherwise. Prove that the binary number $0.b_1b_2b_3…$ is a rational number. Would this statement remain true if we allowed $S$ to be infinite?

Let $a, b$ be integers such that all the roots of the equation $(x^2+ax+20)(x^2+17x+b) = 0$ are negative integers. What is the smallest possible value of $a + b$ ?

Find all integers $n$, $n>1$, with the following property: for all $k$, $0\le k < n$, there exists a multiple of $n$ whose digits sum leaves a remainder of $k$ when divided by $n$.

Let $N$ be a positive integer, and consider an $N \times N$ grid. A [i]right-down path[/i] is a sequence of grid cells such that each cell is either one cell to the right of or one cell below the previous cell in the sequence. A [i]right-up path[/i] is a sequence of grid cells such that each cell is either one cell to the right of or one cell above the previous cell in the sequence. Prove that the cells of the $N \times N$ grid cannot be partitioned into less than $N$ right-down or right-up paths. For example, the following partition of the $5 \times 5$ grid uses $5$ paths. [asy] size(4cm); draw((5,-1)--(0,-1)--(0,-2)--(5,-2)--(5,-3)--(0,-3)--(0,-4)--(5,-4),gray+linewidth(0.5)+miterjoin); draw((1,-5)--(1,0)--(2,0)--(2,-5)--(3,-5)--(3,0)--(4,0)--(4,-5),gray+linewidth(0.5)+miterjoin); draw((0,0)--(5,0)--(5,-5)--(0,-5)--cycle,black+linewidth(2.5)+miterjoin); draw((0,-1)--(3,-1)--(3,-2)--(1,-2)--(1,-4)--(4,-4)--(4,-3)--(2,-3)--(2,-2),black+linewidth(2.5)+miterjoin); draw((3,0)--(3,-1),black+linewidth(2.5)+miterjoin); draw((1,-4)--(1,-5),black+linewidth(2.5)+miterjoin); draw((4,-3)--(4,-1)--(5,-1),black+linewidth(2.5)+miterjoin); [/asy] [i]Proposed by Zixiang Zhou, Canada[/i]