Do integers $a, b$ exist such that $a^{2006} + b^{2006} + 1$ is divisible by $2006^2$?

For any $a$, $b$, $c > 0$ and for any $n \in \mathbb{N}^*$, prove the inequality$$(a - b)\left(\frac{a}{b}\right)^n+(b - c)\left(\frac{b}{c}\right)^n+(c - a)\left(\frac{c}{a}\right)^n\geq (a - b)\frac{a}{b}+(b - c)\frac{b}{c}+(c - a)\frac{c}{a}$$

Let $P$ and $Q$ be points on a circle $k$. A chord $AC$ of $k$ passes through the midpoint $M$ of $PQ$. Consider a trapezoid $ABCD$ inscribed in $k$ with $AB \parallel PQ \parallel CD$. Prove that the intersection point $X$ of $AD$ and $BC$ depends only on $k$ and $P,Q.$

16 NHL teams in the first playoff round divided in pairs and to play series until 4 wins (thus the series could finish with score 4-0, 4-1, 4-2, or 4-3). After that 8 winners of the series play the second playoff round divided into 4 pairs to play series until 4 wins, and so on. After all the final round is over, it happens that $k$ teams have non-negative balance of wins (for example, the team that won in the first round with a score of 4-2 and lost in the second with a score of 4-3 fits the condition: it has $4+3=7$ wins and $2+4=6$ losses). Find the least possible $k$.

Do the medians of a triangle meet in a single point in the Lobachevskii plane? What about the altitudes?

Let $ R_1,R_2, \ldots$ be the family of finite sequences of positive integers defined by the following rules: $ R_1 \equal{} (1),$ and if $ R_{n - 1} \equal{} (x_1, \ldots, x_s),$ then \[ R_n \equal{} (1, 2, \ldots, x_1, 1, 2, \ldots, x_2, \ldots, 1, 2, \ldots, x_s, n).\] For example, $ R_2 \equal{} (1, 2),$ $ R_3 \equal{} (1, 1, 2, 3),$ $ R_4 \equal{} (1, 1, 1, 2, 1, 2, 3, 4).$ Prove that if $ n > 1,$ then the $ k$th term from the left in $ R_n$ is equal to 1 if and only if the $ k$th term from the right in $ R_n$ is different from 1.

An alphabet has $n$ letters. A word is called [i]differentiated [/i] if it has the following property fulfilled: No letter occurs more than once between two identical letters. For example with the alphabet $\{a, b, c, d\}$ the word [i]abbdacbdd [/i] is not, the word [i]bbacbadcdd [/i] is differentiated. (a) Each differentiated word has a maximum of $3n$ letters. (b) How many differentiated words with exactly $3n$ letters are ther

Evaluate: \[\frac{1}{\log_2 (\frac{1}{6})} - \frac{1}{\log_3 (\frac{1}{6})} - \frac{1}{\log_4 (\frac{1}{6})}\]

Convex quadrilateral $ABCD$ satisfies $\angle{CAB} = \angle{ADB} = 30^{\circ}, \angle{ABD} = 77^{\circ}, BC = CD$ and $\angle{BCD} =n^{\circ}$ for some positive integer $n$. Compute $n$.

For $ x \ge 0$ the smallest value of $ \frac {4x^2 \plus{} 8x \plus{} 13}{6(1 \plus{} x)}$ is: $ \textbf{(A)}\ 1 \qquad \textbf{(B)}\ 2 \qquad \textbf{(C)}\ \frac {25}{12} \qquad \textbf{(D)}\ \frac {13}{6} \qquad \textbf{(E)}\ \frac {34}{5}$

Let $S$ be a string of $99$ characters, $66$ of which are $A$ and $33$ are $B$. We call $S$ [i]good[/i] if, for each $n$ such that $1\le n \le 99$, the sub-string made from the first $n$ characters of $S$ has an odd number of distinct permutations. How many good strings are there? Which strings are good?

The function $f: N \to N_0$ is such that $f (2) = 0, f (3)> 0, f (6042) = 2014$ and $f (m + n)- f (m) - f (n) \in\{0,1\}$ for all $m,n \in N$. Determine $f (2014)$. $N_0=\{0,1,2,...\}$

Suppose $a_i, b_i, c_i, i=1,2,\cdots ,n$, are $3n$ real numbers in the interval $\left [ 0,1 \right ].$ Define $$S=\left \{ \left ( i,j,k \right ) |\, a_i+b_j+c_k<1 \right \}, \; \; T=\left \{ \left ( i,j,k \right ) |\, a_i+b_j+c_k>2 \right \}.$$ Now we know that $\left | S \right |\ge 2018,\, \left | T \right |\ge 2018.$ Try to find the minimal possible value of $n$.

The real numbers $a_0, a_1, ... , a_{n+1}$ satisfy $a_0 = a_{n+1} = 0$ and $|a_{k-1} - 2a_k + a_{k+1}| \le 1$ for $k = 1, 2, ... , n$. Show that $|a_k| \le \frac{ k(n + 1 - k)}{2}$ for all $k$.

Let $P(x),\ Q(x)$ be polynomials such that : \[\int_0^2 \{P(x)\}^2dx=14,\ \int_0^2 P(x)dx=4,\ \int_0^2 \{Q(x)\}^2dx=26,\ \int_0^2 Q(x)dx=2.\] Find the maximum and the minimum value of $\int_0^2 P(x)Q(x)dx$.

Tiles I, II, III and IV are translated so one tile coincides with each of the rectangles $A, B, C$ and $D$. In the final arrangement, the two numbers on any side common to two adjacent tiles must be the same. Which of the tiles is translated to Rectangle $C$? [asy] size(400); defaultpen(linewidth(0.8)); path p=origin--(8,0)--(8,6)--(0,6)--cycle; draw(p^^shift(8.5,0)*p^^shift(8.5,10)*p^^shift(0,10)*p); draw(shift(20,2)*p^^shift(28,2)*p^^shift(20,8)*p^^shift(28,8)*p); label("8", (4,6+10), S); label("6", (4+8.5,6+10), S); label("7", (4,6), S); label("2", (4+8.5,6), S); label("I", (4,6+10), N); label("II", (4+8.5,6+10), N); label("III", (4,6), N); label("IV", (4+8.5,6), N); label("3", (0,3+10), E); label("4", (0+8.5,3+10), E); label("1", (0,3), E); label("9", (0+8.5,3), E); label("7", (4,10), N); label("2", (4+8.5,10), N); label("0", (4,0), N); label("6", (4+8.5,0), N); label("9", (8,3+10), W); label("3", (8+8.5,3+10), W); label("5", (8,3), W); label("1", (8+8.5,3), W); label("A", (24,10), N); label("B", (32,10), N); label("C", (24,4), N); label("D", (32,4), N); [/asy] $\mathrm{(A)}\ I \qquad \mathrm{(B)}\ II \qquad \mathrm{(C)}\ III \qquad \mathrm{(D)}\ IV \qquad \mathrm{(E)}\text{ cannot be determined}$

Consider a set $S$ of $200$ points on the plane such that $100$ points are the vertices of a convex polygon $A$ and the other $100$ points are in the interior of the polygon. Moreover, no three of the given points are collinear. A triangulation is a way to partition the interior of the polygon $A$ into triangles by drawing the edges between some two points of S such that any two edges do not intersect in the interior, and each point in $S$ is the vertex of at least one triangle. 1. Prove that the number of edges does not depend on the triangulation. 2. Show that for any triangulation, one can color each triangle by one of three given colors such that any two adjacent triangles have different colors.

If $\lfloor x\rfloor$ is the greatest integer less than or equal to $x$, then \[\displaystyle\sum_{N=1}^{1024} \lfloor \log_{2}N\rfloor = \] $ \textbf{(A)}\ 8192\qquad\textbf{(B)}\ 8204\qquad\textbf{(C)}\ 9218\qquad\textbf{(D)}\ \lfloor \log_{2}(1024!)\rfloor\qquad\textbf{(E)}\ \text{none of these} $

Determine the maximum value of $m^2+n^2$, where $m$ and $n$ are integers in the range $1,2,\ldots,1981$ satisfying $(n^2-mn-m^2)^2=1$.

Erick stands in the square in the 2nd row and 2nd column of a 5 by 5 chessboard. There are \$1 bills in the top left and bottom right squares, and there are \$5 bills in the top right and bottom left squares, as shown below. \[\begin{tabular}{|p{1em}|p{1em}|p{1em}|p{1em}|p{1em}|} \hline \$1 & & & & \$5 \\ \hline & E & & &\\ \hline & & & &\\ \hline & & & &\\ \hline \$5 & & & & \$1 \\ \hline \end{tabular}\] Every second, Erick randomly chooses a square adjacent to the one he currently stands in (that is, a square sharing an edge with the one he currently stands in) and moves to that square. When Erick reaches a square with money on it, he takes it and quits. The expected value of Erick's winnings in dollars is $m/n$, where $m$ and $n$ are relatively prime positive integers. Find $m+n$.

Consider a convex pentagon circumscribed about a circle. We name the lines that connect vertices of the pentagon with the opposite points of tangency with the circle [i]gergonnians[/i]. (a) Prove that if four gergonnians are conncurrent, the all five of them are concurrent. (b) Prove that if there is a triple of gergonnians that are concurrent, then there is another triple of gergonnians that are concurrent.

What the smallest number of circles of radius $\sqrt{2}$ that are needed to cover a rectangle $(a)$ of size $6\times 3$? $(b)$ of size $5\times 3$?

Let $K$ be a finite field, $n \ge 2$ an integer, $f \in K[X]$ an irreducible polynomial of degree $n,$ and $g$ the product of all the nonconstant polynomials in $K[X]$ of degree at most $n-1.$ Prove that $f$ divides $g-1.$

Real number $x,y$ satisfy that $4x^2-5xy+4y^2=5,S=x^2+y^2$, then $\frac{1}{S_\text{max}}+\frac{1}{S_\text{min}}=$________.

In the triangle $ABC$ the relationship $AB+AC = 2BC$ holds. Let $I$ and $M$ be the incenter and intersection point of the medians of triangle $ABC$ respectively, $AL$ its angle bisector, and point $P$ the orthocenter of triangle $BIC$. Prove that the points $L, M, P$ lie on a straight line. (Matvii Kurskyi)