Let $a_{1}=1$, $a_{2}=2$, $a_{3}$, $a_{4}$, $\cdots$ be the sequence of positive integers of the form $2^{\alpha}3^{\beta}$, where $\alpha$ and $\beta$ are nonnegative integers. Prove that every positive integer is expressible in the form \[a_{i_{1}}+a_{i_{2}}+\cdots+a_{i_{n}},\] where no summand is a multiple of any other.

Let $A$ be a closed subset of $\mathbb{R}^{n}$ and let $B$ be the set of all those points $b \in \mathbb{R}^{n}$ for which there exists exactly one point $a_{0}\in A $ such that $|a_{0}-b|= \inf_{a\in A}|a-b|$. Prove that $B$ is dense in $\mathbb{R}^{n}$; that is, the closure of $B$ is $\mathbb{R}^{n}$

Solve the system of equations: $$\begin{cases} x + [y] + \{z\}=3.9 \\ y + [z] + \{x\}= 3.5 \\ z + [x] + \{y\}= 2. \end{cases}$$

Find all real numbers $a,b$ and $c$ such that $a+bc=b+ca=c+ab$.

Let $a, b, c$ be positive real numbers in the interval $[0, 1]$ with $a+b, b+c, c+a \ge 1$. Prove that \[ 1 \le (1-a)^2 + (1-b)^2 + (1-c)^2 + \frac{2\sqrt{2} abc}{\sqrt{a^2+b^2+c^2}}. \]

Let $\Gamma$ be the circumcircle of acute triangle $ABC$. Points $D$ and $E$ are on segments $AB$ and $AC$ respectively such that $AD = AE$. The perpendicular bisectors of $BD$ and $CE$ intersect minor arcs $AB$ and $AC$ of $\Gamma$ at points $F$ and $G$ respectively. Prove that lines $DE$ and $FG$ are either parallel or they are the same line. [i]Proposed by Silouanos Brazitikos, Evangelos Psychas and Michael Sarantis, Greece[/i]

Show that $x^4 > x - \frac12$ for all real $x$.

Ankit, Box, and Clark are playing a game. First, Clark comes up with a prime number less than 100. Then he writes each digit of the prime number on a piece of paper (writing $0$ for the tens digit if he chose a single-digit prime), and gives one each to Ankit and Box, without telling them which digit is the tens digit, and which digit is the ones digit. The following exchange occurs: 1. Clark: There is only one prime number that can be made using those two digits. 2. Ankit: I don't know whether I'm the tens digit or the ones digit. 3. Box: I don't know whether I'm the tens digit or the ones digit. 4. Box: You don't know whether you're the tens digit or the ones digit. 5. Ankit: I don't know whether you're the tens digit or the ones digit. What was Clark's number?

On a circle, $n$ points are selected and the chords joining them in pairs are drawn. Assuming that no three of these chords are concurrent (except at the endpoints), how many points of intersection are there?

The beaver is chess piece that move to $2$ cells by horizontal or vertical. Every cell of $100 \times 100$ chessboard colored in some color,such that we can not get from one cell to another with same color with one move of beaver or knight. What minimal color do we need?

Determine the number of ordered pairs $(x,y)$ with $x$ and $y$ integers between $-5$ and $5,$ inclusive, such that $(x+y)(x+3y)=(x+2y)^2.$

There are $ n \plus{} 1$ cells in a row labeled from $ 0$ to $ n$ and $ n \plus{} 1$ cards labeled from $ 0$ to $ n$. The cards are arbitrarily placed in the cells, one per cell. The objective is to get card $ i$ into cell $ i$ for each $ i$. The allowed move is to find the smallest $ h$ such that cell $ h$ has a card with a label $ k > h$, pick up that card, slide the cards in cells $ h \plus{} 1$, $ h \plus{} 2$, ... , $ k$ one cell to the left and to place card $ k$ in cell $ k$. Show that at most $ 2^n \minus{} 1$ moves are required to get every card into the correct cell and that there is a unique starting position which requires $ 2^n \minus{} 1$ moves. [For example, if $ n \equal{} 2$ and the initial position is 210, then we get 102, then 012, a total of 2 moves.]

Let $S = \left\{ 1,2,\dots,n \right\}$, where $n \ge 1$. Each of the $2^n$ subsets of $S$ is to be colored red or blue. (The subset itself is assigned a color and not its individual elements.) For any set $T \subseteq S$, we then write $f(T)$ for the number of subsets of $T$ that are blue. Determine the number of colorings that satisfy the following condition: for any subsets $T_1$ and $T_2$ of $S$, \[ f(T_1)f(T_2) = f(T_1 \cup T_2)f(T_1 \cap T_2). \]

Compute the number of ways to color each cell of an $18 \times 18$ square grid either ruby or sapphire such that each contiguous $3 \times 3$ subgrid has exactly $1$ ruby cell.

Given a tetrahedron $ABCD$, in which $AB=CD= 13 , AC=BD=14$ and $AD=BC=15$. Show that the centers of the inscribed sphere and sphere around it coincide, and find the radii of these spheres.

Let $R$ be the rectangle on the cartesian plane with vertices $(0,0)$, $(5,0)$, $(5,7)$, and $(0,7)$. Find the number of squares with sides parallel to the axes and vertices that are lattice points that lie within the region bounded by $R$. [i]Proposed by Boyan Litchev[/i] [hide=Solution][i]Solution[/i]. $\boxed{85}$ We have $(6-n)(8-n)$ distinct squares with side length $n$, so the total number of squares is $5 \cdot 7+4 \cdot 6+3 \cdot 5+2 \cdot 4+1\cdot 3 = \boxed{85}$.[/hide]

Two circles $ C_1,C_2$ with different radii are given in the plane, they touch each other externally at $ T$. Consider any points $ A\in C_1$ and $ B\in C_2$, both different from $ T$, such that $ \angle ATB \equal{} 90^{\circ}$. (a) Show that all such lines $ AB$ are concurrent. (b) Find the locus of midpoints of all such segments $ AB$.

Let $d(n)$ denote the largest odd integer divides $n$. Calculate the sum $d(1)+d(2)+d(3)+\dots+d(2^{99})$.

For any real numbers $x, y, z$ with $xyz + x + y + z = 4, $show that $$(yz + 6)^2 + (zx + 6)^2 + (xy + 6)^2 \geq 8 (xyz + 5).$$

Let $ABC$ be an acute-angled triangle with $AC > AB$, let $O$ be its circumcentre, and let $D$ be a point on the segment $BC$. The line through $D$ perpendicular to $BC$ intersects the lines $AO, AC,$ and $AB$ at $W, X,$ and $Y,$ respectively. The circumcircles of triangles $AXY$ and $ABC$ intersect again at $Z \ne A$. Prove that if $W \ne D$ and $OW = OD,$ then $DZ$ is tangent to the circle $AXY.$

At a party there are eight guests, and each participant can't talk with at most three persons. Prove that we can group the persons in four pairs such that in every pair a conversation can take place.

Given two circles $k_{1}$ and $k_{2}$ with centers $O_{1}$ and $O_{2}$ that intersect at the points $A$ and $B$.Passes through A two lines that intersect the circle $k_{1}$ at the points $N_{1}$and $M_{1}$, and the circle $k_{2}$ at the points $N_{2}$ and $M_{2}$ (points $A, N_{1},M_{1}$ in colinear). Denote the midpoints of the segments $N_{1}N_{2}$ and $M_{1}M_{2]}$ , through $N$ and $M$.Prove that: $a)$ Points $M,N,A$ and $B$ lie on a circle $b)$The center of the circle passing through $M,N,A$ and $B$ lies in the middle of the segment $O_{1}O_{2}$

Let $I_a$ be the excenter of triangle $ABC$ with respect to $A$. The line $AI_a$ intersects the circumcircle of triangle ABC at $T$. Let $X$ be a point on segment $TI_a$ such that $X I_a^2 = XA \cdot X T$ The perpendicular line from $X$ to $BC$ intersects $BC$ at $A'$. Define $B'$ and $C'$ in the same way. Prove that $AA',BB'$ and $CC'$ are concurrent.

The four faces of a tetrahedral die are labelled $0, 1, 2,$ and $3,$ and the die has the property that, when it is rolled, the die promptly vanishes, and a number of copies of itself appear equal to the number on the face the die landed on. For example, if it lands on the face labelled $0,$ it disappears. If it lands on the face labelled $1,$ nothing happens. If it lands on the face labelled $2$ or $3,$ there will then be $2$ or $3$ copies of the die, respectively (including the original). Suppose the die and all its copies are continually rolled, and let $p$ be the probability that they will all eventually disappear. Find $\left\lfloor \frac{10}{p} \right\rfloor$.

Let $n$ be a positive integer and $f:[0,1] \to \mathbb{R}$ be an integrable function. Prove that there exists a point $c \in \left[0,1- \frac{1}{n} \right],$ such that [center] $ \int\limits_c^{c+\frac{1}{n}}f(x)\mathrm{d}x=0$ or $\int\limits_0^c f(x) \mathrm{d}x=\int\limits_{c+\frac{1}{n}}^1f(x)\mathrm{d}x.$ [/center]