Let $n > 0$ be an integer. We are given a balance and $n$ weights of weight $2^0, 2^1, \cdots, 2^{n-1}$. We are to place each of the $n$ weights on the balance, one after another, in such a way that the right pan is never heavier than the left pan. At each step we choose one of the weights that has not yet been placed on the balance, and place it on either the left pan or the right pan, until all of the weights have been placed. Determine the number of ways in which this can be done. [i]Proposed by Morteza Saghafian, Iran[/i]

In a square with side 1 are placed $n$ equilateral triangles (without having any parts outside the square) each with side greater than $\sqrt{\frac{2}{3}}$. Prove that all of the $n$ equilateral triangles have a common inner point.

On a soccer tournament with $n\ge 3$ teams taking part, several matches are played in such a way that among any three teams, some two play a match. $(a)$ If $n=7$, find the smallest number of matches that must be played. $(b)$ Find the smallest number of matches in terms of $n$.

A sequence $ a_1, a_2, \ldots$ of non-negative integers is defined by the rule $ a_{n \plus{} 2} \equal{} |a_{n \plus{} 1} \minus{} a_n|$ for $ n\ge 1$. If $ a_1 \equal{} 999, a_2 < 999,$ and $ a_{2006} \equal{} 1$, how many different values of $ a_2$ are possible? $ \textbf{(A) } 165 \qquad \textbf{(B) } 324 \qquad \textbf{(C) } 495 \qquad \textbf{(D) } 499 \qquad \textbf{(E) } 660$

Find all positive integer bases $b \ge 9$ so that the number \[ \frac{{\overbrace{11 \cdots 1}^{n-1 \ 1's}0\overbrace{77 \cdots 7}^{n-1\ 7's}8\overbrace{11 \cdots 1}^{n \ 1's}}_b}{3} \] is a perfect cube in base 10 for all sufficiently large positive integers $n$. [i]Proposed by Yang Liu[/i]

A subset of the set $\{1, 2, 3, ..., 30\}$ is called [i]delicious [/i ]if it doesn't contain elements a and b such that $a = 3b$. A [i]delicious[/i] subset It is called [i]super delicious[/i] if, in addition to being delicious, it is verified that no [i]delicious[/i] subset has more elements than it has. Determine the number of [i]super delicious[/i] subsets

A group of $ 12 $ pirates agree to divide a treasure chest of gold coins among themselves as follows. The $ k^\text{th} $ pirate to take a share takes $ \frac{k}{12} $ of the coins that remain in the chest. The number of coins initially in the chest is the smallest number for which this arrangement will allow each pirate to receive a positive whole number of coins. How many coins does the $ 12^{\text{th}} $ pirate receive? $ \textbf{(A)} \ 720 \qquad \textbf{(B)} \ 1296 \qquad \textbf{(C)} \ 1728 \qquad \textbf{(D)} \ 1925 \qquad \textbf{(E)} \ 3850 $

Construct a quadrilateral with three sides $1$, $4$ and $3$ so that a circle could be circumscribed around it.

Three real numbers are given. Fractional part of the product of every two of them is $ 1\over 2$. Prove that these numbers are irrational. [i]Proposed by A. Golovanov[/i]

Medians $AD$, $BE$, and $CF$ of triangle $ABC$ meet at $G$ as shown. Six small triangles, each with vertex at $G$, are formed. We draw the circles inscribed in triangles $AFG$, $BDG$, and $CDG$ as shown. Prove that if these three circles are all congruent, then $ABC$ is equilateral. [asy] size(200); defaultpen(fontsize(10)); pair C=origin, B=(12,0), A=(3,14), D=midpoint(B--C), E=midpoint(A--C), F=midpoint(A--B), G=centroid(A,B,C); draw(A--B--C--A--D^^B--E^^C--F); draw(incircle(C,G,D)^^incircle(G,D,B)^^incircle(A,F,G)); pair point=G; label("$A$", A, dir(point--A)); label("$B$", B, dir(point--B)); label("$C$", C, dir(point--C)); label("$D$", D, dir(point--D)); label("$E$", E, dir(point--E)); label("$F$", F, dir(point--F)); label("$G$", G, dir(7));[/asy]

Given the parallelogram $ABCD$. The circle $S_1$ passes through the vertex $C$ and touches the sides $BA$ and $AD$ at points $P_1$ and $Q_1$, respectively. The circle $S_2$ passes through the vertex $B$ and touches the side $DC$ at points $P_2$ and $Q_2$, respectively. Let $d_1$ and $d_2$ be the distances from $C$ and $B$ to the lines $P_1Q_1$ and $P_2Q_2$, respectively. Find all possible values of the ratio $d_1:d_2$. [i](I. Voronovich)[/i]

Let $x$ and $y$ be rational numbers, such that $x^{5}+y^{5}=2x^{2}y^{2}$. Prove that $1-xy$ is the square of a rational number.

Consider a right triangle $ABC$, where $A$ is the right angle, and $AC > AB$. Points $E$ on $AC$ and $D$ on $BC$ are chosen so that$ AB = AE = BD$. Prove that the triangle $ADE$ is right if and only if the ratio $AB : AC : BC$ of sides of the triangle $ABC$ is $3 : 4 : 5$. (A. Parovan)

For a positive integer $n$ define $S_n=1!+2!+\ldots +n!$. Prove that there exists an integer $n$ such that $S_n$ has a prime divisor greater than $10^{2012}$.

Consider a function $f:\mathbb{Z}\to \mathbb{Z}$ such that: \[f(m^2+f(n))=f^2(m)+n,\ \forall m,n\in \mathbb{Z}\] Prove that: a)$f(0)=0$; b)$f(1)=1$; c)$f(n)=n,\ \forall n\in \mathbb{Z}$ [i]Lucian Dragomir[/i]

Suppose $a,b,c$ are real numbers so that $a+b+c=15$ and $ab+ac+bc=27$. Find the range of values that may be obtained by the expression $abc$.

Find all number triples $(x,y,z)$ such that when any of these numbers is added to the product of the other two, the result is 2.

Let $ABC$ be an acute triangle. Suppose that circle $\Gamma_1$ has it's center on the side $AC$ and is tangent to the sides $AB$ and $BC$, and circle $\Gamma_2$ has it's center on the side $AB$ and is tangent to the sides $AC$ and $BC$. The circles $\Gamma_1$ and $ \Gamma_2$ intersect at two points $P$ and $Q$. Show that if $A, P, Q$ are collinear, then $AB = AC$.

Let $N$ be the positive integer with 1998 decimal digits, all of them 1; that is, \[N=1111\cdots 11.\] Find the thousandth digit after the decimal point of $\sqrt N$.

Find a four digit number $M$ such that the number $N=4\times M$ has the following properties. (a) $N$ is also a four digit number (b) $N$ has the same digits as in $M$ but in reverse order.

Prove that for equation $$x^{2015} + y^{2015} = z^{2016}$$ there are infinitely many solutions where $x,y$ and $z$ are different natural numbers.

Let $ m$ and $ n$ be positive integers such that $ 1 \le m < n$. In their decimal representations, the last three digits of $ 1978^m$ are equal, respectively, to the last three digits of $ 1978^n$. Find $ m$ and $ n$ such that $ m \plus{} n$ has its least value.

Let $p(x) = x^{2} + bx + c$, where $b$ and $c$ are integers. If $p(x)$ is a factor of both \[x^{4} + 6x^{2} + 25\quad\text{and}\quad 3x^{4} + 4x^{2} + 28x + 5,\] what is $p(1)$? $ \textbf{(A)}\ 0\qquad\textbf{(B)}\ 1\qquad\textbf{(C)}\ 2\qquad\textbf{(D)}\ 4\qquad\textbf{(E)}\ 8 $

Find all prime numbers $p,q$ such that: $$p^4+p^3+p^2+p=q^2+q$$

Let $a > b > c$ be sides of a triangle and $h_a,h_b,h_c$ be the corresponding altitudes. Prove that $a+h_a > b+h_b > c+h_c$.