Jorn wants to cheat at the role play: he intends to cheat the sides to re-label its two octahedra, so that each of the numbers from $1$ to $16$ has the same probability as the sum of the dice occurs. So that the game master does not notice this so easily, he only wants to use numbers from $0$ to $8$ , if necessary several times or not at all. Is this possible?

In the quadrilateral $ABCD$ the side $AB$ has length $7, BC$ length $14, CD$ length $26$, and $DA$ length $23$. Show that the diagonals are perpendicular. You may assume that the quadrilateral is convex (all internal angles are less than $180^o$).

For a sequence, one can perform the following operation: select three adjacent terms $a,b,c,$ and change it into $b,c,a.$ Determine all the possible positive integers $n\geq 3,$ such that after finite number of operation, the sequence $1,2,\cdots, n$ can be changed into $n,n-1,\cdots,1$ finally.

Mathematical clubs are popular among the inhabitants of the same city. Every two of them they have at least one member in common. Prove that we can give the people of the city compasses and rulers so that only one inhabitant gets both, while each club will to have both a ruler and a compass at the full participation of its members.

Suppose that $n - 1$ items $A_1,A_2,...,A_{n-1}$ have already been arranged in the increasing order, and that another item $A_n$ is to be inserted to preserve the order. What is the expected number of comparisons necessary to insert $A_n$?

The sphere inscribed in a tetrahedron $ABCD$ touches face $ABC$ at point $H$. Another sphere touches face $ABC$ at $O$ and the planes containing the other three faces at points exterior to the faces. Prove that if $O$ is the circumcenter of triangle $ABC$, then $H$ is the orthocenter of that triangle.

Let $ a,b,c\in\mathbb{C}^* $ pairwise distinct, having the same absolute value, and satisfying: $$ a^2+b^2+c^2-ab-bc-ca=0. $$ Prove that $ a,b,c $ represents the affixes of the vertices of a right or equilateral triangle.

A triangle $ABC$ and spheres are given in space $S_1$ and $S_2$, each of which passes through points $A, B$ and $C$. For points $M$ spheres $S_1$ not lying in the plane of triangle $ABC$ are drawn lines $MA, MB$ and $MC$, intersecting the sphere $S_2$ for the second time at points $A_1,B_1$ and $C_1$, respectively. Prove that the planes passing through points $A_1, B_1$ and $C_1$, touch a fixed sphere or pass through a fixed point.

Let $ABCD$ be a rhombus with the condition $\angle ABC > 90^o$. The circle $\Gamma_B$ with center at $B$ goes through $C$, and the circle $\Gamma_C$ with center at $C$ goes through $B$. Denote by $E$ one of the intersection points of $\Gamma_B$ and $\Gamma_C$. The line $ED$ intersects intersects $\Gamma_B$ again at $F$. Find the value of $\angle AFB$.

Let $ n$ and $ m$ be given positive integers. In one move, a chess piece called an $ (n,m)$-crocodile goes $ n$ squares horizontally or vertically and then goes $ m$ squares in a perpendicular direction. Prove that the squares of an infinite chessboard can be painted in black and white so that this chess piece always moves from a black square to a white one or vice-versa.

For every natural number $n$, let $Q(n)$ denote the sum of the decimal digits of $n$. Prove that there are infinitely many positive integers $k$ with $Q(3^k) \ge Q(3^{k+1})$.

Circles $\omega_1$ and $\omega_2$ are externally tangent to each other at $P$. A random line $\ell$ cuts $\omega_1$ at $A$ and $C$ and $\omega_2$ at $B$ and $D$ (points $A,C,B,D$ are in this order on $\ell$). Line $AP$ meets $\omega_2$ again at $E$ and line $BP$ meets $\omega_1$ again at $F$. Prove that the radical axis of circles $(PCD)$ and $(PEF)$ is parallel to $\ell$. \\ \\ [i](Vlad Robu)[/i]

Solve for $x$: $2x+7=21$ $\textbf{(A) } 5\qquad\textbf{(B) } 6\qquad\textbf{(C) } 7\qquad\textbf{(D) } 8\qquad\textbf{(E) } 9$

The polynomial $f(z)=az^{2018}+bz^{2017}+cz^{2016}$ has real coefficients not exceeding $2019$, and $f(\tfrac{1+\sqrt{3}i}{2})=2015+2019\sqrt{3}i$. Find the remainder when $f(1)$ is divided by $1000$.

Three clever monkeys divide a pile of bananas. The first monkey takes some bananas from the pile, keeps three-fourths of them, and divides the rest equally between the other two. The second monkey takes some bananas from the pile, keeps one-fourth of them, and divides the rest equally between the other two. The third monkey takes the remaining bananas from the pile, keeps one-twelfth of them, and divides the rest equally between the other two. Given that each monkey receives a whole number of bananas whenever the bananas are divided, and the numbers of bananas the first, second, and third monkeys have at the end of the process are in the ratio $3: 2: 1$, what is the least possible total for the number of bananas?

In a convex quadrilateral $ABCD$, $\angle ABC = 90^o$ , $\angle BAC = \angle CAD$, $AC = AD, DH$ is the alltitude of the triangle $ACD$. In what ratio does the line $BH$ divide the segment $CD$?

Prove that for every natural number $k$ there exists an infinite set of such natural numbers $t$, that the decimal notation of $t$ does not contain zeroes and the sums of the digits of the numbers $t$ and $kt$ are equal.

Let $\vec{v_1},\vec{v_2},\vec{v_3},\vec{v_4}$ and $\vec{v_5}$ be vectors in three dimensions. Show that for some $i,j$ in $1,2,3,4,5$, $\vec{v_i}\cdot \vec{v_j}\ge 0$.

Let $\Gamma$ be a circle, and $\omega_1$ and $\omega_2$ be two non-intersecting circles inside $\Gamma$ that are internally tangent to $\Gamma$ at $X_1$ and $X_2$, respectively. Let one of the common internal tangents of $\omega_1$ and $\omega_2$ touch $\omega_1$ and $\omega_2$ at $T_1$ and $T_2$, respectively, while intersecting $\Gamma$ at two points $A$ and $B$. Given that $2X_1T_1=X_2T_2$ and that $\omega_1$, $\omega_2$, and $\Gamma$ have radii $2$, $3$, and $12$, respectively, compute the length of $AB$. [i]Proposed by James Lin.[/i]

For the nonzero numbers $ a$, $ b$, and $ c$, define \[(a,b,c)\equal{}\frac{abc}{a\plus{}b\plus{}c}.\] Find $(2,4,6)$. $ \textbf{(A)}\ 1 \qquad \textbf{(B)}\ 2 \qquad \textbf{(C)}\ 4 \qquad \textbf{(D)}\ 6 \qquad \textbf{(E)}\ 24$

Find all functions $f : R \to R$ satisfying $f(x)f(y) = f(x + y) + xy$ for all $x, y \in R$.

Find all the pairs of positive integers $(x,p)$ such that p is a prime, $x \leq 2p$ and $x^{p-1}$ is a divisor of $ (p-1)^{x}+1$.

A square with side $2008$ is broken into regions that are all squares with side $1$. In every region, either $0$ or $1$ is written, and the number of $1$'s and $0$'s is the same. The border between two of the regions is removed, and the numbers in each of them are also removed, while in the new region, their arithmetic mean is recorded. After several of those operations, there is only one square left, which is the big square itself. Prove that it is possible to perform these operations in such a way, that the final number in the big square is less than $\frac{1}{2^{10^6}}$.

Find all integer solutions $(x,y,z)$ of the equation $xy+yz+zx-xyz = 2$.

Determine all possible values of $m+n$, where $m$ and $n$ are positive integers satisfying \[\operatorname{lcm}(m,n) - \gcd(m,n) = 103.\]