# [Solutions] The Mathematical Danube Competition 2018 (Senior)

1. Suppose we have a necklace of $n$ beads. Each bead is labeled with an integer and the sum of all these labels is $n - 1$. Prove that we can cut the necklace to form a string, whose consecutive labels $x_1,x_2,...,x_n$ satisfy $\sum_{i=1}^{k} x_i \le k - 1$ for any $k = 1,...,n$
2. Prove that there are infinitely many pairs of positive integers $(m, n)$ such that simultaneously $m$ divides $n^2 + 1$ and $n$ divides $m^2 + 1$.
3. Let $ABC$ be an acute non isosceles triangle. The angle bisector of angle $A$ meets again the circumcircle of the triangle $ABC$ in $D$. Let $O$ be the circumcenter of the triangle $ABC$. The angle bisectors of $\angle AOB$, and $\angle AOC$ meet the circle $\gamma$ of diameter $AD$ in $P$ and $Q$ respectively. The line $PQ$ meets the perpendicular bisector of $AD$ in $R$. Prove that $AR || BC$.
4. Let $n \geq 3$ be an odd number and suppose that each square in a $n \times n$ chessboard is colored either black or white. Two squares are considered adjacent if they are of the same color and share a common vertex and two squares $a,b$ are considered connected if there exists a sequence of squares $c_1,\ldots,c_k$ with $c_1 = a, c_k = b$ such that $c_i, c_{i+1}$ are adjacent for $i=1,2,\ldots,k-1$. Find the maximal number $M$ such that there exists a coloring admitting $M$ pairwise disconnected squares.
 MOlympiad.NET rất mong bạn đọc ủng hộ UPLOAD đề thi và đáp án mới hoặc LIÊN HỆ[email protected]
You can use $\LaTeX$ in comment