Denote $f(m) =\sum_{k=1}^m (-1)^k cos \frac{k\pi}{2 m + 1}$ For which positive integers $m$ is $f(m)$ rational?

A $m \times n$ table is filled with signs $"+"$ and $"-"$. A table is called irreducible if one cannot reduce it to the table filled with $"+"$, applying the following operations (as many times as one wishes). $a)$ It is allowed to flip all the signs in a row or in a column. Prove that an irreducible table contains an irreducible $2\times 2$ sub table. $b)$ It is allowed to flip all the signs in a row or in a column or on a diagonal (corner cells are diagonals of length $1$). Prove that an irreducible table contains an irreducible $4\times 4$ sub table.

Let $ABC$ be an acute-angled triangle with $AB<AC<BC$ and $c(O,R)$ the circumscribed circle. Let $D, E$ be points in the small arcs $AC, AB$ respectively. Let $K$ be the intersection point of $BD,CE$ and $N$ the second common point of the circumscribed circles of the triangles $BKE$ and $CKD$. Prove that $A, K, N$ are collinear if and only if $K$ belongs to the symmedian of $ABC$ passing from $A$.

Let $ x_{1},x_{2},\cdots,x_{m},y_{1},y_{2},\cdots,y_{n}$ be positive real numbers. Denote by $ X \equal{} \sum_{i \equal{} 1}^{m}x,Y \equal{} \sum_{j \equal{} 1}^{n}y.$ Prove that $ 2XY\sum_{i \equal{} 1}^{m}\sum_{j \equal{} 1}^{n}|x_{i} \minus{} y_{j}|\ge X^2\sum_{j \equal{} 1}^{n}\sum_{l \equal{} 1}^{n}|y_{i} \minus{} y_{l}| \plus{} Y^2\sum_{i \equal{} 1}^{m}\sum_{k \equal{} 1}^{m}|x_{i} \minus{} x_{k}|$

[b]a)[/b] Is it possible to find a function $f:\mathbb N^2\to\mathbb N$ such that for every function $g:\mathbb N\to\mathbb N$ and positive integer $M$ there exists $n\in\mathbb N$ such that set $\left\{k\in \mathbb N : f(n,k)=g(k)\right\}$ has at least $M$ elements? [b]b)[/b] Is it possible to find a function $f:\mathbb N^2\to\mathbb N$ such that for every function $g:\mathbb N\to\mathbb N$ there exists $n\in \mathbb N$ such that set $\left\{k\in\mathbb N : f(n,k)=g(k)\right\}$ has an infinite number of elements?

Let $a_1, a_2, \dots$ be a sequence of real numbers satisfying $a_{i+j} \leq a_i+a_j$ for all $i,j=1,2,\dots$. Prove that \[ a_1 + \frac{a_2}{2} + \frac{a_3}{3} + \cdots + \frac{a_n}{n} \geq a_n \] for each positive integer $n$.

Three sidelines of on acute-angled triangle are drawn on the plane. Fyodor wants to draw the altitudes of this triangle using a ruler and a compass. Ivan obstructs him using an eraser. For each move Fyodor may draw one line through two markeed points or one circle centered at a marked point and passing through another marked point. After this Fyodor may mark an arbitrary number of points (the common points of drawn lines, arbitrary points on the drawn lines or arbitrary points on the plane). For each move Ivan erases at most three of marked point. (Fyodor may not use the erased points in his constructions but he may mark them for the second time). They move by turns, Fydors begins. Initially no points are marked. Can Fyodor draw the altitudes?

In the beginnig, each unit square of a $m\times n$ board is colored white. We are supposed to color all the squares such that one of two adjacent squares having a common side is black and the other is white. At each move, we choose a $2 \times 2$ square, and we color each of $4$ squares inversely such that if the square is black then it is colored white or vice versa. For which of the following ordered pair $(m, n)$, can the board be colored in this way? $ \textbf{a)}\ (3,3) \qquad\textbf{b)}\ (2,6) \qquad\textbf{c)}\ (4,8) \qquad\textbf{d)}\ (5,5) \qquad\textbf{e)}\ \text{None of above} $

You flip a fair coin which results in heads ($\text{H}$) or tails ($\text{T}$) with equal probability. What is the probability that you see the consecutive sequence $\text{THH}$ before the sequence $\text{HHH}$?

There are $2015$ coins on a table. For $i = 1, 2, \dots , 2015$ in succession, one must turn over exactly $i$ coins. Prove that it is always possible either to make all of the coins face up or to make all of the coins face down, but not both.

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]