The following operation is allowed on the positive integers: if a number is even, we can divide it by $2$, otherwise we can multiply it by a power of $3$ (different from $3^0$) and add $1$. Prove that we can reach $1$ from any starting positive integer $n$.

Let us call a convex hexagon $ABCDEF$ [i]boring [/i] if $\angle A+ \angle C + \angle E = \angle B + \angle D + \angle F$. a) Is every cyclic hexagon boring? b) Is every boring hexagon cyclic?

Prove that there exists a positive constant $c$ such that the following statement is true: Consider an integer $n > 1$, and a set $\mathcal S$ of $n$ points in the plane such that the distance between any two different points in $\mathcal S$ is at least 1. It follows that there is a line $\ell$ separating $\mathcal S$ such that the distance from any point of $\mathcal S$ to $\ell$ is at least $cn^{-1/3}$. (A line $\ell$ separates a set of points S if some segment joining two points in $\mathcal S$ crosses $\ell$.) [i]Note. Weaker results with $cn^{-1/3}$ replaced by $cn^{-\alpha}$ may be awarded points depending on the value of the constant $\alpha > 1/3$.[/i] [i]Proposed by Ting-Feng Lin and Hung-Hsun Hans Yu, Taiwan[/i]

Two overlapping triangles could divide a plane into up to eight regions, and three overlapping triangles could divide the plane into up to twenty regions. Find, with proof, the maximum number of regions into which six overlapping triangles could divide the plane. Describe or draw an arrangement of six triangles that divides the plane into that many regions.

Let $P(x)$ be a quadratic polynomial with complex coefficients whose $x^2$ coefficient is $1$. Suppose the equation $P(P(x))=0$ has four distinct solutions, $x=3,4,a,b$. Find the sum of all possible values of $(a+b)^2$.

Jerry is mowing a rectangular lawn which is $77$ feet north to south by $83$ feet east to west. His lawn mower cuts a path $18$ inches wide. Jerry mows the grass by cutting a path from west to east across the north side of the lawn and then making a right turn cutting a path along the east side of the lawn. When he completes mowing each side of the lawn, he continues by making right turns to mow a path along the next side. How many right turns will he make?

Let $ABC$ be an acute angle triangle. Suppose that $D,E,F$ are the feet of perpendicluar lines from $A,B,C$ to $BC,CA,AB$. Let $P,Q,R$ be the feet of perpendicular lines from $A,B,C$ to $EF,FD,DE$. Prove that \[ 2(PQ+QR+RP)\geq DE+EF+FD \]

In some magic country, there are banknotes only of values $3$, $25$, $80$ hryvnyas. Businessman Victor ate in one restaurant of this country for $2024$ days in a row, and each day (except the first) he spent exactly $1$ hryvnya more than the day before (without any change). Could he have spent exactly $1000000$ banknotes? [i](Proposed by Oleksii Masalitin)[/i]

Let $ACBD$ be a asquare and $K,L,M,N$ be points of $AB,BC,CD,DA$ respectively. If $O$ is the center of the square , prove that the expression $$ \overrightarrow{OK}\cdot \overrightarrow{OL}+\overrightarrow{OL}\cdot\overrightarrow{OM}+\overrightarrow{OM}\cdot\overrightarrow{ON}+\overrightarrow{ON}\cdot\overrightarrow{OK}$$ is independent of positions of $K,L,M,N$, (i.e. is constant )

Evaluate \[\int_0^{\pi} \left(1+\sum_{k=1}^n k\cos kx\right)^2dx\ \ (n=1,\ 2,\ \cdots).\] [i]2011 Doshisya University entrance exam/Life Medical Sciences[/i]

Find the least positive integer $n$ for which there exists a set $\{s_1, s_2, \ldots , s_n\}$ consisting of $n$ distinct positive integers such that \[ \left( 1 - \frac{1}{s_1} \right) \left( 1 - \frac{1}{s_2} \right) \cdots \left( 1 - \frac{1}{s_n} \right) = \frac{51}{2010}.\] [i]Proposed by Daniel Brown, Canada[/i]

For each integer $\, n \geq 2, \,$ determine, with proof, which of the two positive real numbers $\, a \,$ and $\, b \,$ satisfying \[ a^n = a + 1, \hspace{.3in} b^{2n} = b + 3a \] is larger.

Let $n\geq3$ be a positive integer. Let $C_1,C_2,C_3,\ldots,C_n$ be unit circles in the plane, with centres $O_1,O_2,O_3,\ldots,O_n$ respectively. If no line meets more than two of the circles, prove that \[ \sum\limits^{}_{1\leq i<j\leq n}{1\over O_iO_j}\leq{(n-1)\pi\over 4}. \]

Let $a,b,$ and $c$ be real numbers such that \begin{align*} a+b+c &= 2, \text{ and} \\ a^2+b^2+c^2&= 12 \end{align*} What is the difference between the maximum and minimum possible values of $c$? $ \textbf{(A)}\ 2\qquad\textbf{(B)}\ \frac{10}{3}\qquad\textbf{(C)}\ 4\qquad\textbf{(D)}\ \frac{16}{3}\qquad\textbf{(E)}\ \frac{20}{3} $

For each integer $n$ ($n \ge 2$), let $f(n)$ denote the sum of all positive integers that are at most $n$ and not relatively prime to $n$. Prove that $f(n+p) \neq f(n)$ for each such $n$ and every prime $p$.

Find all pairs of positive integers $(a, b)$ such that $$11ab \le a^3 - b^3 \le 12ab.$$

Let $f : Z_+ \to Z_+$ such that: a) $f(n + 1) > f(n)$ for all $n \in Z_+$ b) $f(n + f(m)) = f(n) + m + 1$ for all $n,m \in Z_+$ Find $f(2006)$.

Let $a$ be non zero real number. Find the area of the figure enclosed by the line $y=ax$, the curve $y=x\ln (x+1).$

Let $ n \ge 3$ be a prime number and $ a_{1} < a_{2} < \cdots < a_{n}$ be integers. Prove that $ a_{1}, \cdots,a_{n}$ is an arithmetic progression if and only if there exists a partition of $ \{0, 1, 2, \cdots \}$ into sets $ A_{1},A_{2},\cdots,A_{n}$ such that \[ a_{1} \plus{} A_{1} \equal{} a_{2} \plus{} A_{2} \equal{} \cdots \equal{} a_{n} \plus{} A_{n},\] where $ x \plus{} A$ denotes the set $ \{x \plus{} a \vert a \in A \}$.

For all positive real numbers $x, y, z$, show that $ \frac{x(2x-y)}{y(2z+x)}+\frac{y(2y-z)}{z(2x+y)}+\frac{z(2z-x)}{x(2y+z)} \geq 1$ is true.

Suppose that $7$ boys and $13$ girls line up in a row. Let $S$ be the number of places in the row where a boy and a girl are standing next to each other. For example, for the row $GBBGGGBGBGGGBGBGGBGG$ we have $S=12$. The average value of $S$ (if all possible orders of the 20 people are considered) is closest to $ \textbf{(A)}\ 9 \qquad\textbf{(B)}\ 10 \qquad\textbf{(C)}\ 11 \qquad\textbf{(D)}\ 12 \qquad\textbf{(E)}\ 13 $

Each of the $12$ edges of a cube is labeled $0$ or $1$. Two labelings are considered different even if one can be obtained from the other by a sequence of one or more rotations and/or reflections. For how many such labelings is the sum of the labels on the edges of each of the $6$ faces of the cube equal to $2?$ $\textbf{(A) }8\qquad\textbf{(B) }10\qquad\textbf{(C) }12\qquad\textbf{(D) }16\qquad\textbf{(E) }20$

In $\vartriangle ABC$, $AC > AB$. $B$ is reflected across $\overline{AC}$ to a point $D$, and $C$ is reflected across $\overline{AD}$ to a point $E$. Suppose that $AC = 6\sqrt3 + 6$, $BC = 6$, and $\overline{BC} \parallel \overline{AE}$. Compute $AB$.

On the coordinate plane, at some points with integer coordinates, there is a pebble (a finite number of pebbles). It is allowed to make the following move: select a pair of pebbles, take some vector $\vec{a}$ with integer coordinates and then move one of the selected pebbles to vector $\vec{a}$, and the other to the opposite vector $-\vec{a}$; it is forbidden that there should be more than one pebble at one point. Is it always possible to achieve a situation in which all the pebbles lie on the same straight line in a few moves? [i] K. Ivanov [/i]

Circles $\omega_1$ and $\omega_2$ intersect at points $A$ and $B$. Segment $PQ$ is tangent to $\omega_1$ at $P$ and to $\omega_2$ at $Q$, and $A$ is closer to $PQ$ than $B$. Point $X$ is on $\omega_1$ such that $PX\parallel QB$, and point $Y$ is on $\omega_2$ such that $QY\parallel PB$. Given that $\angle APQ=30^\circ$ and $\angle PQA=15^\circ$, find the ratio $AX/AY$.