A sequence of integers, $\{a_{n}\}_{n \ge 1}$ with $a_{1}>0$, is defined by \[a_{n+1}=\frac{a_{n}}{2}\;\;\; \text{if}\;\; n \equiv 0 \;\; \pmod{4},\] \[a_{n+1}=3 a_{n}+1 \;\;\; \text{if}\;\; n \equiv 1 \; \pmod{4},\] \[a_{n+1}=2 a_{n}-1 \;\;\; \text{if}\;\; n \equiv 2 \; \pmod{4},\] \[a_{n+1}=\frac{a_{n}+1}{4}\;\;\; \text{if}\;\; n \equiv 3 \; \pmod{4}.\] Prove that there is an integer $m$ such that $a_{m}=1$.

The city of Bridge Village has some highways. Highways are closed curves that have intersections with each other or themselves in $4$-way crossroads. Mr.Bridge Lover, mayor of the city, wants to build a bridge on each crossroad in order to decrease the number of accidents. He wants to build the bridges in such a way that in each highway, cars pass above a bridge and under a bridge alternately. By knowing the number of highways determine that this action is possible or not. [i]Proposed by Erfan Salavati[/i]

Let $n > 1$ be a positive integer and $a_1, a_2, \dots, a_{2n} \in \{ -n, -n + 1, \dots, n - 1, n \}$. Suppose \[ a_1 + a_2 + a_3 + \dots + a_{2n} = n + 1 \] Prove that some of $a_1, a_2, \dots, a_{2n}$ have sum 0.

Let $a_1=0$, $a_2=1$, and $a_{n+2}=a_{n+1}+a_n$ for all positive integers $n$. Show that there exists an increasing infinite arithmetic progression of integers, which has no number in common in the sequence $\{a_n\}_{n \ge 0}$.

Let $A_1A_2A_3A_4A_5$ be a regular pentagon with side length 1. The sides of the pentagon are extended to form the 10-sided polygon shown in bold at right. Find the ratio of the area of quadrilateral $A_2A_5B_2B_5$ (shaded in the picture to the right) to the area of the entire 10-sided polygon. [asy] size(8cm); defaultpen(fontsize(10pt)); pair A_2=(-0.4382971011,5.15554989475), B_4=(-2.1182971011,-0.0149584477027), B_5=(-4.8365942022,8.3510997895), A_3=(0.6,8.3510997895), B_1=(2.28,13.521608132), A_4=(3.96,8.3510997895), B_2=(9.3965942022,8.3510997895), A_5=(4.9982971011,5.15554989475), B_3=(6.6782971011,-0.0149584477027), A_1=(2.28,3.18059144705); filldraw(A_2--A_5--B_2--B_5--cycle,rgb(.8,.8,.8)); draw(B_1--A_4^^A_4--B_2^^B_2--A_5^^A_5--B_3^^B_3--A_1^^A_1--B_4^^B_4--A_2^^A_2--B_5^^B_5--A_3^^A_3--B_1,linewidth(1.2)); draw(A_1--A_2--A_3--A_4--A_5--cycle); pair O = (A_1+A_2+A_3+A_4+A_5)/5; label("$A_1$",A_1, 2dir(A_1-O)); label("$A_2$",A_2, 2dir(A_2-O)); label("$A_3$",A_3, 2dir(A_3-O)); label("$A_4$",A_4, 2dir(A_4-O)); label("$A_5$",A_5, 2dir(A_5-O)); label("$B_1$",B_1, 2dir(B_1-O)); label("$B_2$",B_2, 2dir(B_2-O)); label("$B_3$",B_3, 2dir(B_3-O)); label("$B_4$",B_4, 2dir(B_4-O)); label("$B_5$",B_5, 2dir(B_5-O)); [/asy]

Compare the size of the definite integrals? \[ \int_0^{\frac {\pi}{4}} x^{2008}\tan ^{2008}x\ dx,\ \int_0^{\frac {\pi}{4}} x^{2009}\tan ^{2009}x\ dx,\ \int_0^{\frac {\pi}{4}} x^{2010}\tan ^{2010}x\ dx\]

Let $a, b$ be coprime positive integers. A positive integer $n$ is said to be [i]weak[/i] if there do not exist any nonnegative integers $x, y$ such that $ax+by=n$. Prove that if $n$ is a [i]weak[/i] integer and $n < \frac{ab}{6}$, then there exists an integer $k \geq 2$ such that $kn$ is [i]weak[/i].

Let $a,b,c $be positive real numbers.Prove that $\frac{8}{(a+b)^2 + 4abc} + \frac{8}{(b+c)^2 + 4abc} + \frac{8}{(a+c)^2 + 4abc} + a^2 + b^2 + c ^2 \ge \frac{8}{a+3} + \frac{8}{b+3} + \frac{8}{c+3}$.

Alice's favorite number has the following properties: [list] [*] It has 8 distinct digits. [*]The digits are decreasing when read from left to right. [*]It is divisible by 180.[/list] What is Alice's favorite number? [i]Author: Anderson Wang[/i]

Let $ABCD$ be a circumscribed quadrilateral (i. e. a quadrilateral which has an incircle). The exterior angle bisectors of the angles $DAB$ and $ABC$ intersect each other at $K$; the exterior angle bisectors of the angles $ABC$ and $BCD$ intersect each other at $L$; the exterior angle bisectors of the angles $BCD$ and $CDA$ intersect each other at $M$; the exterior angle bisectors of the angles $CDA$ and $DAB$ intersect each other at $N$. Let $K_{1}$, $L_{1}$, $M_{1}$ and $N_{1}$ be the orthocenters of the triangles $ABK$, $BCL$, $CDM$ and $DAN$, respectively. Show that the quadrilateral $K_{1}L_{1}M_{1}N_{1}$ is a parallelogram.

Let $c = \frac{2\pi}{11}.$ What is the value of $$\frac{\sin 3c \cdot \sin 6c \cdot \sin 9c \cdot \sin 12c \cdot \sin 15c}{\sin c \cdot \sin 2c \cdot \sin 3c \cdot \sin 4c \cdot \sin 5c}?$$ $\textbf{(A)}\ -1 \qquad\textbf{(B)}\ \frac{\sqrt{-11}}{5} \qquad\textbf{(C)}\ \frac{\sqrt{11}}{5} \qquad\textbf{(D)}\ \frac{10}{11} \qquad\textbf{(E)}\ 1$

Let $S$ be a set of $N \ge 3$ points in the plane. Assume that no $3$ points in $S$ are collinear. The segments with both endpoints in $S$ are colored in two colors. Prove that there is a set of $N - 1$ segments of the same color which don't intersect except in their endpoints such that no subset of them forms a polygon with positive area.

Let $\Pi$ be the set of rectangular parallelepipeds that have at least one edge of integer length. If a rectangular parallelepiped $P_0$ can be decomposed into parallelepipeds $P_1,P_2, . . . ,P_N\in \Pi$, prove that $P_0\in \Pi$.

$1399$ points and some chords between them is given. $a)$ In every step we can take two chords $RS,PQ$ with a common point other than $P,Q,R,S$ and erase [u]exactly one[/u] of $RS,PQ$ and draw $PS,PR,QS,QR$ let $s$ be the minimum of chords after some steps. Find the maximum of $s$ over all initial positions. $b)$ In every step we can take two chords $RS,PQ$ with a common point other than $P,Q,R,S$ and erase [u]both[/u] of $RS,PQ$ and draw $PS,PR,QS,QR$ let $s$ be the minimum of chords after some steps. Find the maximum of $s$ over all initial positions. [i]Proposed by Afrouz Jabalameli, Abolfazl Asadi[/i]

Let $\left\{ {{a}_{n}} \right\}_{n \geq 1}$ and $\left\{ {{b}_{n}} \right\}_{n \geq 1}$ be two infinite arithmetic progressions, each of which the first term and the difference are mutually prime natural numbers. It is known that for any natural $n$, at least one of the numbers $\left( a_n^2+a_{n+1}^2 \right)\left( b_n^2+b_{n+1}^2 \right) $ or $\left( a_n^2+b_n^2 \right) \left( a_{n+1}^2+b_{n+1}^2 \right)$ is an perfect square. Prove that ${{a}_{n}}={{b}_{n}}$, for any natural $n$ .

Quadratic polynomials $P(x)$ and $Q(x)$ with leading coefficients $1$, both of which have real roots, are called friendly if for all $t \in [0,1]$ quadratic polynomial $tP(x)+(1-t)Q(x)$ also has real roots. a) Provide an example of quadratic polynomials $P(x)$ and $Q(x)$ with leading coefficients $1$ and which have real roots, that are not friendly. b) Prove that for any two quadratic polynomials $P(x)$ and $Q(x)$ with leading coefficients $1$ that have real roots, there is a quadratic polynomial $R(x)$ which has a leading coefficient $1$ and which is friendly to both $P$ and $Q$

A fox stands in the centre of the field which has the form of an equilateral triangle, and a rabbit stands at one of its vertices. The fox can move through the whole field, while the rabbit can move only along the border of the field. The maximal speeds of the fox and rabbit are equal to $u$ and $v$, respectively. Prove that: (a) If $2u>v$, the fox can catch the rabbit, no matter how the rabbit moves. (b) If $2u\le v$, the rabbit can always run away from the fox.

Consider a sequence given by $a_n=a_{n-1}+3a_{n-2}+a_{n-3}$, where $a_0=a_1=a_2=1$. What is the remainder of $a_{2013}$ divided by $7$?

A triangle $ABC$ has sides $BC = a, CA = b, AB = c$ with $a < b < c$ and area $S$. Determine the largest number $u$ and the least number $v$ such that, for every point $P$ inside $\triangle ABC$, the inequality $u \le PD + PE + PF \le v$ holds, where $D,E, F$ are the intersection points of $AP,BP,CP$ with the opposite sides.

Suppose 100 people are gathered around at a park, each with an envelope with their name on it (all their names are distinct). Then, the envelopes are uniformly and randomly permuted between the people. If $N$ is the number of people who end up with their original envelope, find the expected value of $N^5$. [i]Proposed by Michael Duncan[/i]

Let $\mathbb Z$ be the set of all integers. Find all functions $f:\mathbb Z\to\mathbb Z$ satisfying the following conditions: 1. $f(f(x))=xf(x)-x^2+2$ for all $x\in\mathbb Z$; 2. $f$ takes all integer values. [i](I. Voronovich)[/i]

Given in the plane is a lattice and a grid rectangle with sides parallel to the coordinate axes. We divide the rectangle into grid triangles with area $\frac12$. Prove that the number of right angled triangles is at least twice as much as the shorter side of the rectangle. (A grid polygon is a polygon such that both coordinates of each vertex is an integer.)

A natural number $k > 1$ is called [i]good[/i] if there exist natural numbers $$a_1 < a_2 < \cdots < a_k$$ such that $$\dfrac{1}{\sqrt{a_1}} + \dfrac{1}{\sqrt{a_2}} + \cdots + \dfrac{1}{\sqrt{a_k}} = 1$$. Let $f(n)$ be the sum of the first $n$ [i][good[/i] numbers, $n \geq$ 1. Find the sum of all values of $n$ for which $f(n+5)/f(n)$ is an integer.

A polygon can be transformed into a new polygon by making a straight cut, which creates two new pieces each with a new edge. One piece is then turned over and the two new edges are reattached. Can repeated transformations of this type turn a square into a triangle?

Determine all functions $f:\mathbb{R}\rightarrow\mathbb{R}$ such that $$x^2f(x)+yf(y^2)=f(x+y)f(x^2-xy+y^2)$$ for all $x,y\in\mathbb{R}$.