Given an integer $m > 1$, we call the number $x{}$ dangerous if $x{}$ divides the number $y{}$, which is obtained by writing the digits of $x{}$ in base $m{}$ in reverse order, with $x\neq y$. Prove that if there exists a three-digit (in base $m$) dangerous number for a given $m$, then there exists a two-digit (in base $m$) dangerous number.

There were 20 participants in a chess tournament. Each of them played with each other twice: once as white and once as black. Let us say that participant $X{}$ is no weaker than participant $Y{}$ if $X{}$ has won at least the same number of games playing white as $Y{}$ and also has won at least the same number of games playing black as $Y{}$ . Do there exist for sure two participants $A{}$ and $B{}$ such that $A{}$ is not weaker than $B{}$? [i]Boris Frenkin[/i]

The diagram below shows circles radius $1$ and $2$ externally tangent to each other and internally tangent to a circle radius $3$. There are relatively prime positive integers $m$ and $n$ so that a circle radius $\frac{m}{n}$ is internally tangent to the circle radius $3$ and externally tangent to the other two circles as shown. Find $m+n$. [asy] import graph; size(5cm); real labelscalefactor = 0.5; pen dps = linewidth(0.7) + fontsize(10); defaultpen(dps); pen dotstyle = black; draw(circle((8,2), 3)); draw(circle((8,1), 2)); draw(circle((8,4), 1)); draw((8,-1)--(8,5)); draw(circle((9.72,3.28), 0.86)); label("$ 2 $",(7.56,1.38),SE*labelscalefactor); label("$ 1 $",(7.6,4.39),SE*labelscalefactor); [/asy]

A polynomial $P(x)$ with integer coefficients and a positive integer $a>1$, are such that for all integers $x$, there exists an integer $z$ such that $aP(x)=P(z)$. Find all such pairs of $(P(x),a)$.

Let $P$ and $P '$ be two unequal regular $n-$gons and $A$ and $A'$two points inside $P$ and$ P '$, respectively.Suppose $\{ d_1 , d_2 , \cdots d_n \}$ are the distances from $A $ to the vertices of $P$ and $\{ d'_1 , d'_2 , \cdots d'_n \}$ are defines similarly for $P',A'$. Is it possible for $\{ d'_1 , d'_2 , \cdots d'_n \}$ to be a permutation of $\{ d_1 , d_2 , \cdots d_n \}$ ?

Let $n$ be a positive integer and $a_1,a_2,\ldots a_{2n+1}$ be positive reals. For $k=1,2,\ldots ,2n+1$, denote $b_k = \max_{0\le m\le n}\left(\frac{1}{2m+1} \sum_{i=k-m}^{k+m} a_i \right)$, where indices are taken modulo $2n+1$. Prove that the number of indices $k$ satisfying $b_k\ge 1$ does not exceed $2\sum_{i=1}^{2n+1} a_i$.

Let $P=A_1A_2\cdots A_k$ be a convex polygon in the plane. The vertices $A_1, A_2, \ldots, A_k$ have integral coordinates and lie on a circle. Let $S$ be the area of $P$. An odd positive integer $n$ is given such that the squares of the side lengths of $P$ are integers divisible by $n$. Prove that $2S$ is an integer divisible by $n$.

It is known about two triangles that for each of them the sum of the lengths of any two of its sides is equal to the sum of the lengths of any two sides of the other triangle. Are triangles necessarily congruent?

A 9-digit number $N$ is given, whose digits are non-zero and all different.The sums of all consecutive three-digit segments in the decimal representation of number $N$ are calculated and arranged in increasing order.Is it possible to obtain the following sequences as a result of this operation? $\text{a)}$ $11,15,16,18,19,21,22$ $\text{b)}$ $11,15,16,18,19,21,23$

Let $x_1, x_2, \ldots ,x_n(n\ge 2)$ be real numbers greater than $1$. Suppose that $|x_i-x_{i+1}|<1$ for $i=1, 2,\ldots ,n-1$. Prove that \[\frac{x_1}{x_2}+\frac{x_2}{x_3}+\ldots +\frac{x_{n-1}}{x_n}+\frac{x_n}{x_1}<2n-1\]

Let $ ABCD$ be a trapezoid with $ AB$ and $ CD$ parallel, $ \angle D \equal{} 2 \angle B, AD \equal{} 5,$ and $ CD \equal{} 2.$ Then $ AB$ equals A. 7 B. 8 C. 13/2 D. 27/4 E. $ 5 \plus{} \frac{3 \sqrt{2}}{2}$

Let $f$ be a function defined on $[0, 2022]$, such that $f(0) = f(2022) = 2022$, and $$|f(x) - f(y)| \le 2|x -y|,$$ for all $x, y$ in $[0, 2022]$. Prove that for each $x, y$ in $[0, 2022]$, the distance between $f(x)$ and $f(y)$ does not exceed $2022$.

Compute \[\int_1^2\dfrac{9x+4}{x^5+3x^2+x}dx.\] (No, your TI-89 doesn’t know how to do this one. Yes, the end is near.)

A half-circle of diameter $EF$ is placed on the side $BC$ of a triangle $ABC$ and it is tangent to the sides $AB$ and $AC$ in the points $Q$ and $P$ respectively. Prove that the intersection point $K$ between the lines $EP$ and $FQ$ lies on the altitude from $A$ of the triangle $ABC$. [i]Albania[/i]

How many $ 15$-letter arrangements of $ 5$ A's, $ 5$ B's, and $ 5$ C's have no A's in the first $ 5$ letters, no B's in the next $ 5$ letters, and no C's in the last $ 5$ letters? $ \textbf{(A)}\ \sum_{k\equal{}0}^5\binom{5}{k}^3 \qquad \textbf{(B)}\ 3^5\cdot 2^5 \qquad \textbf{(C)}\ 2^{15} \qquad \textbf{(D)}\ \frac{15!}{(5!)^3} \qquad \textbf{(E)}\ 3^{15}$

Let $ABC$ be a triangle with circumcenter $O$. Let $P$ and $Q$ be points on the segments $AB$ and $AC$, respectively, such that $BP : PQ : QC = AC : CB : BA$. Prove that the points $A$, $P$, $Q$ and $O$ lie on one circle. [i]Alternative formulation.[/i] Let $O$ be the center of the circumcircle of a triangle $ABC$. If $P$ and $Q$ are points on the sides $AB$ and $AC$, respectively, satisfying $\frac{BP}{PQ}=\frac{CA}{BC}$ and $\frac{CQ}{PQ}=\frac{AB}{BC}$, then show that the points $A$, $P$, $Q$ and $O$ lie on one circle.

Let $ \left( s_n \right)_{n\ge 1 } $ be a sequence with $ s_1 $ and defined recursively as $ s_{n+1}=s_n^2-s_n+1. $ Prove that any two terms of this sequence are coprime. [i]Dan Nedeianu[/i]

Triangle $ABC$ is inscribed in circle with center $O$. Let $P$ be a point on arc $AB$ which does not contain point $C$. Perpendicular from point $P$ on line $BO$ intersects side $AB$ in point $S$, and side $BC$ in $T$. Perpendicular from point $P$ on line $AO$ intersects side $AB$ in point $Q$, and side $AC$ in $R$. (i) Prove that triangle $PQS$ is isosceles (ii) Prove that $\frac{PQ}{QR}=\frac{ST}{PQ}$

Let's call a natural number a palindrome, the decimal notation of which is equally readable from left to right and right to left (decimal notation cannot start from zero; for example, the number $1221$ is a palindrome, but the numbers $1231, 1212$ and $1010$ are not). Which palindromes among the numbers from $10,000$ to $999,999$ have an odd sum of digits, which have an one even, and how many times are the ones with odd sum more than the ones with the even sum?

In an acute triangle the feet of altitudes drawn from vertices $A$ and $B$ are $D$ and $E$, respectively. Let $M$ be the midpoint of side $AB$. Line $CM$ intersects the circumcircle of $CDE$ again in point $P$ and the circumcircle of $CAB$ again in point $Q$. Prove that $|MP| = |MQ|$.

Find all real $x$ such that $ \sqrt{x - \frac{1}{x}} + \sqrt{1 - \frac{1}{x}}> \frac{x - 1}{x}$

Let $\triangle A_1A_2A_3$ be an equilateral triangle with unit side length. For $k = 1$, $2$, and $3$, let $B_k$ be the point on the boundary of $\triangle A_1A_2A_3$ located $1/3$ unit away from $A_k$ in the clockwise direction and let $C_k$ be the point on the boundary of $\triangle A_1A_2A_3$ located $1/3$ unit away from $A_k$ in the counterclockwise direction. What fraction of the area of $\triangle A_1A_2A_3$ is the area of the intersection of $\triangle B_1B_2B_3$ and $\triangle C_1C_2C_3$?

Circles $C_1,C_2,$ and $C_3$ have radii $2,3,$ and $6$ respectively. If the fourth circle $C_4$ is the sum of the areas of $C_1,C_2,$ and $C_3,$ compute the radius of $C_4.$ [i]Proposed by Alex Li[/i]

Find all positive integers $n$ for which the number $1!+2!+3!+\cdots+n!$ is a perfect power of an integer.

Let $S$ be the set of all 9-digit natural numbers, which are written only with the digits 1, 2, and 3. Find all functions $f:S\rightarrow \{1,2,3\}$ which satisfy the following conditions: (1) $f(111111111)=1$, $f(222222222)=2$, $f(333333333)=3$, $f(122222222)=1$; (2) If $x,y\in S$ differ in each digit position, then $f(x)\neq f(y)$.