$u(t)$ is solution of the following initial value problem. $$\begin{cases} u''(t) + u'(t) = \sin u(t) &\;\;(t>0),\\ u(0)=1,\;\; u'(0)=0 & \end{cases}$$ (1) Show that $u(t)$ and $u'(t)$ are bounded on $t>0$. (2) Find $\lim\limits_{t\to\infty} u(t)$ with proof.

Let $n \geq 2$ be a given integer. At any point $(i, j)$ with $i, j \in\mathbb{ Z}$ we write the remainder of $i+j$ modulo $n$. Find all pairs $(a, b)$ of positive integers such that the rectangle with vertices $(0, 0)$, $(a, 0)$, $(a, b)$, $(0, b)$ has the following properties: [b](i)[/b] the remainders $0, 1, \ldots , n-1$ written at its interior points appear the same number of times; [b](ii)[/b] the remainders $0, 1, \ldots , n -1$ written at its boundary points appear the same number of times.

Consider $2009$ cards, each having one gold side and one black side, lying on parallel on a long table. Initially all cards show their gold sides. Two player, standing by the same long side of the table, play a game with alternating moves. Each move consists of choosing a block of $50$ consecutive cards, the leftmost of which is showing gold, and turning them all over, so those which showed gold now show black and vice versa. The last player who can make a legal move wins. (a) Does the game necessarily end? (b) Does there exist a winning strategy for the starting player? [i]Proposed by Michael Albert, Richard Guy, New Zealand[/i]

A set $ S$ of points from the space will be called [b]completely symmetric[/b] if it has at least three elements and fulfills the condition that for every two distinct points $ A$ and $ B$ from $ S$, the perpendicular bisector plane of the segment $ AB$ is a plane of symmetry for $ S$. Prove that if a completely symmetric set is finite, then it consists of the vertices of either a regular polygon, or a regular tetrahedron or a regular octahedron.

Let $M$ and $N$ be two palindrome numbers, each having $9$ digits and the palindromes don't start with $0$. If $N>M$ and between $N$ and $M$ there aren't any palindromes, find all values of $N-M$.

Consider a quartet of positive numbers $(a,b,c,d)$. In one step, we transform it to $(ab,bc,cd,da)$. Prove that you can never obtain the initial set if neither of $a,b,c,d$ is $1$.

Find all sets of positive integers $A=\big\{ a_1,a_2,...a_{19}\big\}$ which satisfy the following: $1\big) a_1+a_2+...+a_{19}=2017;$ $2\big) S(a_1)=S(a_2)=...=S(a_{19})$ where $S\big(n\big)$ denotes digit sum of number $n$.

Let $BH_b, CH_c$ be altitudes of an acute-angled triangle $ABC$. The line $H_bH_c$ meets the circumcircle of $ABC$ at points $X$ and $Y$. Points $P,Q$ are the reflections of $X,Y$ about $AB,AC$ respectively. Prove that $PQ \parallel BC$. [i]Proposed by Pavel Kozhevnikov[/i]

Finitely many cards are placed in two stacks, with more cards in the left stack than the right. Each card has one or more distinct names written on it, although different cards may share some names. For each name, we define a “shuffle” by moving every card that has this name written on it to the opposite stack. Prove that it is always possible to end up with more cards in the right stack by picking several distinct names, and doing in turn the shuffle corresponding to each name.

Let $n > 1$ be an integer. In a [i]configuration[/i] of an $n \times n$ board, each of the $n^2$ cells contains an arrow, either pointing up, down, left, or right. Given a starting configuration, Turbo the snail starts in one of the cells of the board and travels from cell to cell. In each move, Turbo moves one square unit in the direction indicated by the arrow in her cell (possibly leaving the board). After each move, the arrows in all of the cells rotate $90^{\circ}$ counterclockwise. We call a cell [i]good[/i] if, starting from that cell, Turbo visits each cell of the board exactly once, without leaving the board, and returns to her initial cell at the end. Determine, in terms of $n$, the maximum number of good cells over all possible starting configurations. [i]Proposed by Melek Güngör, Turkey[/i]

Let $n$ be an integer greater than 2. A positive integer is said to be [i]attainable [/i]if it is 1 or can be obtained from 1 by a sequence of operations with the following properties: 1.) The first operation is either addition or multiplication. 2.) Thereafter, additions and multiplications are used alternately. 3.) In each addition, one can choose independently whether to add 2 or $n$ 4.) In each multiplication, one can choose independently whether to multiply by 2 or by $n$. A positive integer which cannot be so obtained is said to be [i]unattainable[/i]. [b]a.)[/b] Prove that if $n\geq 9$, there are infinitely many unattainable positive integers. [b]b.)[/b] Prove that if $n=3$, all positive integers except 7 are attainable.

There are $n$ boys and $n$ girls sitting around a circular table, where $n>3$. In every move, we are allowed to swap the places of $2$ adjacent children. The [b]entropy[/b] of a configuration is the minimal number of moves such that at the end of them each child has at least one neighbor of the same gender. Find the maximal possible entropy over the set of all configurations. [i]Authored by Viktor Simjanoski[/i]

$200 \times 200$ square is colored in chess order. In one move we can take every $2 \times 3$ rectangle and change color of all its cells. Can we make all cells of square in same color ?

An unordered triple $(a,b,c)$ in one move can be changed to either of the triples: $(a,b,2a+2b-c)$,$(a,2a+2c-b,c)$ or $(2b+2c-a,b,c)$. Can one get from triple $(3,5,14)$ the triple $(9,8,11)$ in finite amount of moves?

In the coordinate plane consider the set $ S$ of all points with integer coordinates. For a positive integer $ k$, two distinct points $A$, $ B\in S$ will be called $ k$-[i]friends[/i] if there is a point $ C\in S$ such that the area of the triangle $ ABC$ is equal to $ k$. A set $ T\subset S$ will be called $ k$-[i]clique[/i] if every two points in $ T$ are $ k$-friends. Find the least positive integer $ k$ for which there exits a $ k$-clique with more than 200 elements. [i]Proposed by Jorge Tipe, Peru[/i]