Let $a$ be the sum of the numbers: $99 \times 0.9$ $999 \times 0.9$ $9999 \times 0.9$ $\vdots$ $999\cdots 9 \times 0.9$ where the final number in the list is $0.9$ times a number written as a string of $101$ digits all equal to $9$. Find the sum of the digits in the number $a$.

Given are $5$ segments, such that from any three of them one can form a triangle. Prove that from some three of them one can form an acute-angled triangle.

Sequence $(a_n)$ satisfies that $3a_{n+1}+a_n=4(n\geq1),a_1=9$, let $S_n=\sum_{i=1}^{n}a_i$, then the minumum value of $n$ such that $|S_n-n-6|<\frac{1}{125}$ is $\text{(A)}5\qquad\text{(B)}6\qquad\text{(C)}7\qquad\text{(D)}8$

For any prime $p$, prove that there exists integer $x_0$ such that $p | (x^2_0 - x_0 + 3)$ $\Leftrightarrow$ there exists integer $y_0$ such that $p | (y^2_0 - y_0 + 25).$

Given arbitrary positive integer $ a$ larger than $ 1$, show that for any positive integer $ n$, there always exists a n-degree integral coefficient polynomial $ p(x)$, such that $ p(0)$, $ p(1)$, $ \cdots$, $ p(n)$ are pairwise distinct positive integers, and all have the form of $ 2a^k\plus{}3$, where $ k$ is also an integer.

In a sphere $S_0$ we radius $r$ a cube $K_0$ has been inscribed. Then in the cube $K_0$ another sphere $S_1$ has been inscribed and so on to infinity. Calculate the volume of all spheres created in this way.

In a group of five people any two are either friends or enemies , no three of them are friends of each other and no three of them are enemies of each other . Prove that every person in this group has exactly two friends .

Suppose an integer $x$, a natural number $n$ and a prime number $p$ satisfy the equation $7x^2-44x+12=p^n$. Find the largest value of $p$.

Let $p(n)$ be the number of partitions of the natural number $n$ into natural summands. The diversity of a partition is by definition the number of different summands in it. Denote by $q(n)$ the sum of the diversities of all the $p(n) $ partitions of $n$. (For example, $p(4) = 5$, the five distinct partitions of $4$ being $4, 3 + 1, 2+2, 2 + 1 + 1, 1 + 1 + 1 + 1,$ and $g(4) =1 + 2+1+ 2+1 = 7$.) Prove that, for all natural numbers $n$, (a) $q(n)= 1 + P(1) + P(2) + p(3) + ...+ p(n -1)$, (b) $q(n) < \sqrt{2n} p(n)$. (AV Zelevinskiy, Moscow)

Let $G$ be a simple graph on the infinite vertex set $V=\{v_1, v_2, v_3,\ldots\}$. Suppose every subgraph of $G$ on a finite vertex subset is $10$-colorable, Prove that $G$ itself is $10$-colorable.

Let $p_n$ be the $n^{\mbox{th}}$ prime counting from the smallest prime $2$ in increasing order. For example, $p_1=2, p_2=3, p_3 =5, \cdots$ (a) For a given $n \ge 10$, let $r$ be the smallest integer satisfying \[2\le r \le n-2, \quad n-r+1 < p_r\] and define $N_s=(sp_1p_2\cdots p_{r-1})-1$ for $s=1,2,\ldots, p_r$. Prove that there exists $j, 1\le j \le p_r$, such that none of $p_1,p_2,\cdots, p_n$ divides $N_j$. (b) Using the result of (a), find all positive integers $m$ for which \[p_{m+1}^2 < p_1p_2\cdots p_m\]

Two distinct circles $K_1$ and $K_2$ are drawn in the plane. They intersect at points $A$ and $B$, where $AB$ is the diameter of $K_1$. A point $P$ on $K_2$ and inside $K_1$ is also given. Using only a "T-square" (i.e. an instrument which can produce a straight line joining two points and the perpendicular to a line through a point on or off the line), find a construction for two points $C$ and $D$ on $K_1$ such that $CD$ is perpendicular to $AB$ and $\angle CPD$ is a right angle.

What is the sum of the first $10$ primes? [i]2015 CCA Math Bonanza Lightning Round #2.1[/i]

Greta is completing an art project. She has twelve sheets of paper: four red, four white, and four blue. She also has twelve paper stars: four red, four white, and four blue. She randomly places one star on each sheet of paper. The probability that no star will be placed on a sheet of paper that is the same color as the star is $\frac{m}{n}$ where $m$ and $n$ are relatively prime positive integers. Find $n - 100m.$

There are many sets of two different positive integers $a$ and $b$, both less than $50$, such that $a^2$ and $b^2$ end in the same last two digits. For example, $35^2 = 1225$ and $45^2 = 2025$ both end in $25$. What are all possible values for the average of $a$ and $b$? For the purposes of this problem, single-digit squares are considered to have a leading zero, so for example we consider $2^2$ to end with the digits 04, not $4$.

In a simple graph on $n$ vertices, every set of $k$ vertices has an odd number of common neighbours. Prove that $n+k$ must be odd.

On a rectangular board $100 \times 300$, two people take turns coloring the cells that have not yet been colored. The first one colors cells in yellow, and the second one in blue. Coloring is completed when every cell of the board is colored. A [i]connected sequence[/i] of cells is a sequence of cells in which every two consecutive cells share a common side (and all cells in the sequence are different). Consider all possible connected sequences of yellow cells. The result of the first player is the number of cells in the connected sequence of yellow cells of maximum length. The first player's goal is to maximize the result, and the second player's goal is to make the first player's result as small as possible. Prove that if each player tries to achieve his goal, the result of the first player will be no more than $200$. [i]Proposed by Mykhailo Shtandenko and Fedir Yudin[/i]

If real numbers $x$, $y$, and $z$ satisfy $x^2-yz = 1$ and $y^2-xz = 4$ such that $|x+y+z|$ is minimized, then $z^2-xy$ can be expressed in the form $\sqrt{a}-b$ where $a$ and $b$ are positive integers. Find $a+b$. [i]Proposed by Andy Xu[/i]

The set of $\{1,2,3,...,63\}$ was divided into three non-empty disjoint sets $A,B$. Let $a,b,c$ be the product of all numbers in each set $A,B,C$ respectively and finally we have determined the greatest common divisor of these three products. What was the biggest result we could get?

Let $ABCD$ be a convex quadrilateral with $AC \perp BD$, and let $P$ be the intersection of $AC$ and $BD$. Suppose that the distance from $P$ to $AB$ is $99$, the distance from $P$ to $BC$ is $63$, and the distance from $P$ to $CD$ is $77$. What is the distance from $P$ to $AD$?

Find all real numbers $x$ such that $$x^3 = \{(x + 1)^3\}$$ where $\{y\}$ denotes the fractional part of $y$, i.e. the difference between $y$ and the largest integer less than or equal to $y$.

Find the positive real numbers $x,y$ for which $\frac{x+y}{2},\sqrt{xy},\frac{2xy}{x+y},\sqrt{\frac{x^2 +y^2}{2}}$ are integers whose sum is $66$.

Cerena, Faith, Edna, and Veronica each have a cube. Aarnő knows that the side lengths of each of their cubes are distinct integers greater than $1$, and he is trying to guess their exact values. Each girl fully paints the surface of her cube in Carolina blue before splitting the entire cube into $1\times1\times1$ cubes. Then, [list=disc] [*] Cerena reveals how many of her $1\times1\times1$ cubes have exactly $0$ blue faces. [*] Faith reveals how many of her $1\times1\times1$ cubes have exactly $1$ blue faces. [*] Edna reveals how many of her $1\times1\times1$ cubes have exactly $2$ blue faces. [*] Veronica reveals how many of her $1\times1\times1$ cubes have exactly $3$ blue faces. [/list] Whose side lengths can Aarnő deduce from these statements? [i]Jason Lee[/i]

A [i]snake of length $k$[/i] is an animal which occupies an ordered $k$-tuple $(s_1, \dots, s_k)$ of cells in a $n \times n$ grid of square unit cells. These cells must be pairwise distinct, and $s_i$ and $s_{i+1}$ must share a side for $i = 1, \dots, k-1$. If the snake is currently occupying $(s_1, \dots, s_k)$ and $s$ is an unoccupied cell sharing a side with $s_1$, the snake can [i]move[/i] to occupy $(s, s_1, \dots, s_{k-1})$ instead. The snake has [i]turned around[/i] if it occupied $(s_1, s_2, \dots, s_k)$ at the beginning, but after a finite number of moves occupies $(s_k, s_{k-1}, \dots, s_1)$ instead. Determine whether there exists an integer $n > 1$ such that: one can place some snake of length $0.9n^2$ in an $n \times n$ grid which can turn around. [i]Nikolai Beluhov[/i]

Solve in the set of $ 2\times 2 $ integer matrices the equation $$ X^2-4\cdot X+4\cdot\left(\begin{matrix}1\quad 0\\0\quad 1\end{matrix}\right) =\left(\begin{matrix}7\quad 8\\12\quad 31\end{matrix}\right) . $$