The inscribed circle of an acute triangle $ABC$ meets the segments $AB$ and $BC$ at $D$ and $E$ respectively. Let $I$ be the incenter of the triangle $ABC$. Prove that the intersection of the line $AI$ and $DE$ is on the circle whose diameter is $AC$(passing through A, C).

Let $n$ and $k$ are integers with $n>0$. Prove that \[-\frac{1}{2n}\sum^{n-1}_{m=1}\cot \frac{\pi m}{n}\sin \frac{2\pi km}{n}= \begin{cases}\tfrac{k}{n}-\lfloor\tfrac{k}{n}\rfloor-\frac12 & \text{if }k|n \\ 0 & \text{otherwise}\end{cases}.\]

How many positive integers $N$ in the segment $\left[10, 10^{20} \right]$ are such that if all their digits are increased by $1$ and then multiplied, the result is $N+1$? [i](F. Bakharev)[/i]

$n>1$ is odd number. There are numbers $n,n+1,n+2,...,2n-1$ on the blackboard. Prove that we can erase one number, such that the sum of all numbers will be not divided any number on the blackboard.

Let $P$ be a point and $\omega$ be a circle with center $O$ and radius $r$ . We define the power of the point $P$ with respect to the circle $\omega$ to be $OP^2 - r^2$ , and we denote this by pow $(P, \omega)$. We define the radical axis of two circles $\omega_1$ and $\omega_2$ to be the locus of all points P such that pow $(P,\omega_1) =$ pow $(P,\omega_2)$. It turns out that the pairwise radical axes of three circles are either concurrent or pairwise parallel. The concurrence point is referred to as the radical center of the three circles. In $\vartriangle ABC$, let $I$ be the incenter, $\Gamma$ be the circumcircle, and $O$ be the circumcenter. Let $A_1,B_1,C_1$ be the point of tangency of the incircle of $\vartriangle ABC$ with side $BC,CA, AB$, respectively. Let $X_1,X_2 \in \Gamma$ such that $X_1,B_1,C_1,X_2$ are collinear in this order. Let $M_A$ be the midpoint of $BC$, and define $\omega_A$ as the circumcircle of $\vartriangle X_1X_2M_A$. Define $\omega_B$ ,$\omega_C$ analogously. The goal of this problem is to show that the radical center of $\omega_A$, $\omega_B$, $\omega_C$ lies on line $OI$. (a) Let$ A'_1$ denote the intersection of $B_1C_1$ and $BC$. Show that $\frac{A_1B}{A_1C}=\frac{A'_1B}{A'_1C}$. (b) Prove that $A_1$ lies on $\omega_A$. (c) Prove that $A_1$ lies on the radical axis of $\omega_B$ and $\omega_C$ . (d) Prove that the radical axis of $\omega_B$ and $\omega_C$ is perpendicular to $B_1C_1$. (e) Prove that the radical center of $\omega_A$, $\omega_B$, $\omega_C$ is the orthocenter of $\vartriangle A_1B_1C_1$. (f ) Conclude that the radical center of $\omega_A$, $\omega_B$, $\omega_C$ , $O$, and $I$ are collinear. PS. You had better use hide for answers.

Let $a$ and $b$ be positive integers. We tile a rectangle with dimensions $a$ and $b$ using squares whose side-length is a power of $2$, i.e. the tiling may include squares of dimensions $1\times 1, 2\times 2, 4\times 4$ etc. Denote by $M$ the minimal number of squares in such a tiling. Numbers $a$ and $b$ can be uniquely represented as the sum of distinct powers of $2$: $a=2^{a_1}+\cdots+2^{a_k},\; b=2^{b_1}+\cdots +2^{b_\ell}.$ Show that $$M=\sum_{i=1}^k \;\sum_{j=1}^{\ell} 2^{|a_i-b_j|}.$$

Prove that sum of $12$ consecutive integers cannot be a square. Give an example of $11$ consecutive integers whose sum is a perfect square.

Define $M_n = \{1,2,...,n\}$, for any $n\in N$. A collection of $3$-element subsets of $M_n$ is said to be [i]fine [/i] if for any coloring of elements of $M_n$ in two colors there is a subset of the collection all three elements of which are of the same color. For any $n\ge 5$ find the minimal possible number of the $3$-element subsets of $M_n$ in the fine collection. (E. Barabanov, S. Mazanik, I. Voronovich)

Prove The Following identity: $ \sum_{j \equal{} 0}^n \left ({3n \plus{} 2 \minus{} j \choose j}2^j \minus{} {3n \plus{} 1 \minus{} j \choose j \minus{} 1}2^{j \minus{} 1}\right ) \equal{} 2^{3n}$. The Second term on left hand side is to be regarded zero for j=0.

There are $n$ positive integers on the board. We can add only positive integers $c=\frac{a+b}{a-b}$, where $a$ and $b$ are numbers already writted on the board. $a)$ Find minimal value of $n$, such that with adding numbers with described method, we can get any positive integer number written on the board $b)$ For such $n$, find numbers written on the board at the beginning

The Centerville Middle School chess team consists of two boys and three girls. A photographer wants to take a picture of the team to appear in the local newspaper. She decides to have them sit in a row with a boy at each end and the three girls in the middle. How many such arrangements are possible? $\textbf{(A) }2\qquad\textbf{(B) }4\qquad\textbf{(C) }5\qquad\textbf{(D) }6\qquad \textbf{(E) }12$

Find the sum of all the positive integers that are divisors of either $96$ or $180$.

Find all positive integers $n$ such that $3^n - 2^n - 1$ is a perfect square.

Let $n$ be a positive integer and $P_1, P_2, \ldots, P_n$ be different points on the plane such that distances between them are all integers. Furthermore, we know that the distances $P_iP_1, P_iP_2, \ldots, P_iP_n$ forms the same sequence for all $i=1,2, \ldots, n$ when these numbers are arranged in a non-decreasing order. Find all possible values of $n$.

Let $ G$ be a solvable torsion group in which every Abelian subgroup is finitely generated. Prove that $ G$ is finite. [i]J. Pelikan[/i]

Compute \[\int_0^\infty \dfrac{e^{-x}\sin(x)}{x}dx\]

Let $n \ge 2$ be an integer. In each cell of a $4n \times 4n$ table we write the sum of the cell row index and the cell column index. Initially, no cell is colored. A move consists of choosing two cells which are not colored and coloring one of them in red and one of them in blue. Show that, however Alex perfors $n^2$ moves, Jane can afterwards perform a number of moves (eventually none) after which the sum of the numbers written in the red cells is the same as the sum of the numbers written in the blue ones.

Let $O$ be the circumcenter of triangle $ABC$ with circumradius $15$. Let $G$ be the centroid of $ABC$ and let $M$ be the midpoint of $BC$. If $BC=18$ and $\angle MOA=150^\circ$, find the area of $OMG$.

Prove that for every integer $n \geq 2$ there exist $n$ different positive integers such that for any two of these integers $a$ and $b$ their sum $a+b$ is divisible by their difference $a - b.$

Show that for any tetrahedron, the condition that opposite edges have the same length is equivalent to the condition that the segment drawn between the midpoints of any two opposite edges is perpendicular to the two edges.

For each positive integer $k$, let $S(k)$ be the sum of the digits of $k$ in the decimal system. Prove that there exists a positive integer $k$, which does not have the digit $9$ in its decimal representation, such that: $$S(2^{24^{2017}}k)=S(k)$$

Let $N$ be a normed linear space with a dense linear subspace $M$. Prove that if $L_1,\ldots,L_m$ are continuous linear functionals on $N$, then for all $x\in N$ there exists a sequence $(y_n)$ in $M$ converging to $x$ satisfying $L_j(y_n)=L_j(x)$ for all $j=1,\ldots,m$ and $n\in \mathbb{N}$.

Determine the least possible value of $\dfrac{(x^2+1)(4y^2+1)(9z^2+1)}{6xyz}$ if $x$, $y$ and $z$ are positive real numbers.

Consider the following table where initially all squares contain zeros: $ \begin{tabular}{ | l | c | r| } \hline 0 & 0 & 0 \\ \hline 0 & 0 & 0 \\ \hline 0 & 0 & 0 \\ \hline \end{tabular} $ To change the table, the following operation is allowed: a $2 \times 2$ square formed by adjacent squares is chosen, and a unit is added to all its numbers. Complete the following table, knowing that it was obtained by a sequence of permitted operations $ \begin{tabular}{ | l | c | r| } \hline 14 & & \\ \hline 19 & 36 & \\ \hline & 16 & \\ \hline \end{tabular} $

Assume $a_1,a_2,...,a_{14}$ are positive integers such that $\sum_{i=1}^{14}3^{a_i} = 6558$. Prove that the numbers $a_1,a_2,...,a_{14}$ consist of the numbers $1,...,7$, each taken twice.