Let $d$ be a positive integer. The seqeunce $a_1, a_2, a_3,...$ of positive integers is defined by $a_1 = 1$ and $a_{n + 1} = n\left \lfloor \frac{a_n}{n} \right \rfloor+ d$ for $n = 1,2,3, ...$ . Prove that there exists a positive integer $N$ so that the terms $a_N,a_{N + 1}, a_{N + 2},...$ form an arithmetic progression. Note: If $x$ is a real number, $\left \lfloor x \right \rfloor $ denotes the largest integer that is less than or equal to $x$.

The kindergarten group is standing in the column of pairs. The number of boys equals the number of girls in each of the two columns. The number of mixed (boy and girl) pairs equals to the number of the rest pairs. Prove that the total number of children in the group is divisible by eight.

There are $24$ different pencils, $4$ different colors, and $6$ pencils of each color. They were given to $6$ children in such a way that each got $4$ pencils. What is the least number of children that you can randomly choose so that you can guarantee that you have pencils of all colors. P.S. for 10 grade gives same problem with $40$ pencils, $10$ of each color and $10$ children.

An acute scalene triangle $ABC$ with circumcircle $\Omega$ is given. The altitude from $B$ intersects side $AC$ at $B_1$ and circle $\Omega$ at $B_2$. The circle with diameter $B_1B_2$ intersects circle $\Omega$ again at $B_3$. Similarly, the altitude from $C$ intersects side $AB$ at $C_1$ and circle $\Omega$ at $C_2$. The circle with diameter $C_1C_2$ intersects circle $\Omega$ again at $C_3$. Let $X$ be the intersection of lines $B_1B_3$ and $C_1C_3$, and let $Y$ be the intersection of lines $B_3C$ and $C_3B$. Prove that line $XY$ bisects side $BC$.

Let $ABCD$ be a unit square, and let there be two unit circles centered at $C$ and $D$. Let $P$ be the point of intersection of the two circles inside the square. Compute $\angle APB$ in degrees.

Denote $S$ as the set of prime divisors of all integers of form $2^{n^2+1} - 3^n, n \in Z^+$. Prove that $S$ and $P-S$ both contain infinitely many elements (where $P$ is set of prime numbers).

Prove that $\lfloor \sqrt[3]{n}+\sqrt[3]{n+1}+\sqrt[3]{n+2}\rfloor =\lfloor \sqrt[3]{27n+26}\rfloor$ for all positive integers $n$.

Each of six fruit baskets contains pears, plums and apples. The number of plums in each basket equals the total number of apples in all other baskets combined while the number of apples in each basket equals the total number of pears in all other baskets combined. Prove that the total number of fruits is a multiple of $31$.

An ant, which is on an edge of a cube of side $8$, must travel on the surface and return to the starting point. It's path must contain interior points of the six faces of the cube and should visit only once each face of the cube. Find the length of the path that the ant can carry out and justify why it is the shortest path.

Consider all triangles $ABC$ in the cartesian plane whose vertices are at lattice points (i.e. with integer coordinates) and which contain exactly one lattice point (to be denoted $P$) in its interior. Let the line $AP$ meet $BC$ at $E$. Determine the maximum possible value of the ratio $\frac{AP}{PE}$.

Each of $1000$ elves has a hat, red on the inside and blue on the outside or vise versa. An elf with a hat that is red outside can only lie, and an elf with a hat that is blue outside can only tell the truth. One day every elf tells every other elf, “Your hat is red on the outside.” During that day, some of the elves turn their hats inside out at any time during the day. (An elf can do that more than once per day.) Find the smallest possible number of times any hat is turned inside out.

Determine all pairs $(a,b)$ of positive integers for which there exist positive integers $g$ and $N$ such that $$\gcd (a^n+b,b^n+a)=g$$ holds for all integers $n\geqslant N.$ (Note that $\gcd(x, y)$ denotes the greatest common divisor of integers $x$ and $y.$) [i]Proposed by Valentio Iverson, Indonesia[/i]

A [i]composite[/i] (positive integer) is a product $ab$ with $a$ and $b$ not necessarily distinct integers in $\{2,3,4,\dots\}$. Show that every composite is expressible as $xy+xz+yz+1$, with $x,y,z$ positive integers.

Let $\ell$ be a positive integer, and let $m,n$ be positive integers with $m\geq n$, such that $A_1,A_2,\cdots,A_m,B_1,\cdots,B_m$ are $m+n$ pairwise distinct subsets of the set $\{1,2,\cdots,\ell\}$. It is known that $A_i\Delta B_j$ are pairwise distinct, $1\leq i\leq m, 1\leq j\leq n$, and runs over all nonempty subsets of $\{1,2,\cdots,\ell\}$. Find all possible values of $m,n$.

[i](9 pts)[/i] Let $ABC$ be a triangle with circumcenter $O$. The interior bisector of $\angle BAC$ intersects $BC$ at $D$. Circle $\omega_A$ is tangent to segments $AB$ and $AC$ and internally tangent to the circumcircle of $ABC$ at the point $P$. Let $E$ and $F$ be the respective points at which the $B$-excircle and $C$-excircle of $ABC$ are tangent to $AC$ and $AB$. Suppose that lines $BE$ and $CF$ pass through a common point $N$ on the circumcircle of $AEF$. [i]Note: for a triangle $ABC$, the $A$-excircle is the circle lying outside triangle $ABC$ that is tangent to side $BC$ and the extensions of sides $AB, AC$. The $B, C$-excircles are defined similarly.[/i] (a) [i](7 pts)[/i] Prove that the circumcircle of $PDO$ passes through $N$. (b) [i](2 pts)[/i] Suppose that $\frac{PD}{BC} = \frac{2}{7}$. Find, with proof, the value of $\cos (\angle BAC)$.

The inscribed and exscribed sphere of a triangular pyramid $ABCD$ touch her face $BCD$ at different points $X$ and $Y$. Prove that the triangle $AXY$ is obtuse triangle.

Let $f(x)$ be an even twice differentiable function such that $f''(0)\ne0$. Prove that $f(x)$ has a local extremum at $x=0$.

A clueless ant makes the following route: starting at point $ A $ goes $ 1$ cm north, then $ 2$ cm east, then $ 3$ cm south, then $ 4$ cm west, immediately $ 5$ cm north, continues $ 6$ cm east, and so on, finally $ 41$ cm north and ends in point $ B $. Calculate the distance between $ A $ and $ B $ (in a straight line).

Find all the integers written as $\overline{abcd}$ in decimal representation and $\overline{dcba}$ in base $7$.

Prove that if $n$ is large enough, then for each coloring of the subsets of the set $\{1,2,...,n\}$ with $1391$ colors, two non-empty disjoint subsets $A$ and $B$ exist such that $A$, $B$ and $A\cup B$ are of the same color.

Let $S = \lbrace 1, 2, \ldots, 15 \rbrace$. Let $A_1, A_2, \ldots, A_n$ be $n$ subsets of $S$ which satisfy the following conditions: [b]I.[/b] $|A_i| = 7, i = 1, 2, \ldots, n$; [b]II.[/b] $|A_i \cap A_j| \leq 3, 1 \leq i < j \leq n$ [b]III.[/b] For any 3-element subset $M$ of $S$, there exists $A_k$ such that $M \subset A_k$. Find the smallest possible value of $n$.

Evaluate $$\sum_{n=0}^{\infty} \sum_{k=0}^{\infty} \min (n, k) \left( \frac12 \right)^n\left( \frac13 \right)^k$$

Alice and Bob are playing the following game: They have an $8\times8$ chessboard. Initially, all grids are white. Each round, Alice chooses a white grid and paints it black. Then Bob chooses one of the neighbors of that grid and paints it black. Or he does nothing. After that, Alice may decide to continue the game or not. The goal of Alice is to maximize the number of connected components of black grids, on the other hand, Bob wants to minimize that number. If both of them are extremely smart, how many connected components will be in the end of the game?

Let $N \ge 5$ be given. Consider all sequences $(e_1,e_2,...,e_N)$ with each $e_i$ equal to $1$ or $-1$. Per move one can choose any five consecutive terms and change their signs. Two sequences are said to be similar if one of them can be transformed into the other in finitely many moves. Find the maximum number of pairwise non-similar sequences of length $N$.

Given $a,b,c,d>0$, prove that: \[\sum_{cyc}\frac{c}{a+2b}+\sum_{cyc}\frac{a+2b}{c}\geq 8(\frac{(a+b+c+d)^2}{ab+ac+ad+bc+bd+cd}-1),\] where $\sum_{cyc}f(a,b,c,d)=f(a,b,c,d)+f(d,a,b,c)+f(c,d,a,b)+f(b,c,d,a)$.