Given is a natural number $n \geq 3$. Solve the system of equations: $\[ \begin{cases} \tan (x_1) + 3 \cot (x_1) &= 2 \tan (x_2) \\ \tan (x_2) + 3 \cot (x_2) &= 2 \tan (x_3) \\ & \dots \\ \tan (x_n) + 3 \cot (x_n) &= 2 \tan (x_1) \\ \end{cases} \]$

Suppose that $A, B, C$, and $X$ are any four distinct points in the plane with $$\max \,(BX,CX) \le AX \le BC.$$ Prove that $\angle BAC \le 150^o$.

If $\theta=\arctan \frac{5}{12}$, $z=\frac{\cos 2\theta+\text{i}\sin2\theta}{239+\text{i}}$, then $\arg z=$________.

The real-valued function $f$ is defined for all positive integers. For any integers $a>1, b>1$ with $d=\gcd (a, b)$, we have \[f(ab)=f(d)\left(f\left(\frac{a}{d}\right)+f\left(\frac{b}{d}\right)\right) \] Determine all possible values of $f(2001)$.

Let $ a$ and $ b$ be two positive integers such that $ a \cdot b \plus{} 1$ divides $ a^{2} \plus{} b^{2}$. Show that $ \frac {a^{2} \plus{} b^{2}}{a \cdot b \plus{} 1}$ is a perfect square.

Given triangle $ABC$ and the points$D,E\in \left( BC \right)$, $F,G\in \left( CA \right)$, $H,I\in \left( AB \right)$ so that $BD=CE$, $CF=AG$ and $AH=BI$. Note with $M,N,P$ the midpoints of $\left[ GH \right]$, $\left[ DI \right]$ and $\left[ EF \right]$ and with ${M}'$ the intersection of the segments $AM$and $BC$. a) Prove that $\frac{B{M}'}{C{M}'}=\frac{AG}{AH}\cdot \frac{AB}{AC}$. b) Prove that the segments$AM$, $BN$ and $CP$ are concurrent.

Let $n$ and $a \leq n$ be two positive integers. There's $2n$ people sitting around a circle reqularly. Two people are friend iff one of their distance in the circle is $a$(that is , $a-1$ people are between them). Find all integers $a$ in terms of $n$ st we can choose $n$ of these people , no two of them positioned in front of each other(means they're not antipodes of each other in the circle) and the total friendship between them is an odd number.

Baron Munchausen claims that he got a map of a country that consists of five cities. Each two cities are connected by a direct road. Each road intersects no more than one another road (and no more than once). On the map, the roads are colored in yellow or red, and while circling any city (along its border) one can notice that the colors of crossed roads alternate. Can Baron's claim be true?

Given the sequence $(u_n)$ satisfying:$$\left\{ \begin{array}{l} 1 \le {u_1} \le 3\\ {u_{n + 1}} = 4 - \dfrac{{2({u_n} + 1)}}{{{2^{{u_n}}}}},\forall n \in \mathbb{Z^+}. \end{array} \right.$$ Prove that: $1\le u_n\le 3,\forall n\in \mathbb{Z^+}$ and find the limit of $(u_n).$

The point $O$ inside the convex polygon makes isosceles triangle with all the pairs of its vertices. Prove that $O$ is the centre of the circumscribed circle. [u]other formulation:[/u] $P$ is a convex polygon and $X$ is an interior point such that for every pair of vertices $A, B$, the triangle $XAB$ is isosceles. Prove that all the vertices of $P$ lie on a circle with center $X$.

Let $n>2$ be an integer. A deck contains $\frac{n(n-1)}{2}$ cards,numbered \[1,2,3,\cdots , \frac{n(n-1)}{2}\] Two cards form a [i]magic pair[/i] if their numbers are consecutive , or if their numbers are $1$ and $\frac{n(n+1)}{2}$. For which $n$ is it possible to distribute the cards into $n$ stacks in such a manner that, among the cards in any two stacks , there is exactly one [i]magic pair[/i]?

Prove that every tetrahedron has a vertex whose three edges have the right lengths to form a triangle.

A sequence of positive reals $\{ a_n \}$ is defined below. $$a_0 = 1, a_1 = 3, a_{n+2} = \frac{a_{n+1}^2+2}{a_n}$$ Show that for all nonnegative integer $n$, $a_n$ is a positive integer.

Prove that two congruent regular hexagons can be cut up into (altogether) $6$ parts such that these $6$ parts can be composed to form an equilateral triangle (without gaps or overlaps).

For each $n\in\mathbb N$, the function $f_n$ is defined on real numbers $x\ge n$ by $$f_n(x)=\sqrt{x-n}+\sqrt{x-n+1}+\ldots+\sqrt{x+n}-(2n+1)\sqrt x.$$(a) If $n$ is fixed, prove that $\lim_{x\to+\infty}f_n(x)=0$. (b) Find the limit of $f_n(n)$ as $n\to+\infty$.

Let the sequence $u_n$ be defined by $u_0=0$ and $u_{2n}=u_n$, $u_{2n+1}=1-u_n$ for each $n\in\mathbb N_0$. (a) Calculate $u_{1990}$. (b) Find the number of indices $n\le1990$ for which $u_n=0$. (c) Let $p$ be a natural number and $N=(2^p-1)^2$. Find $u_N$.

Given that $i^2=-1$, for how many integers $n$ is $(n+i)^4$ an integer? $\text{(A)} \ \text{none} \qquad \text{(B)} \ 1 \qquad \text{(C)} \ 2 \qquad \text{(D)} \ 3 \qquad \text{(E)} \ 4$

General Tilly and the Duke of Wallenstein play "Divide and rule!" (Divide et impera!). To this end, they arrange $N$ tin soldiers in $M$ companies and command them by turns. Both of them must give a command and execute it in their turn. Only two commands are possible: The command "[i]Divide![/i]" chooses one company and divides it into two companies, where the commander is free to choose their size, the only condition being that both companies must contain at least one tin soldier. On the other hand, the command "[i]Rule![/i]" removes exactly one tin soldier from each company. The game is lost if in your turn you can't give a command without losing a company. Wallenstein starts to command. a) Can he force Tilly to lose if they start with $7$ companies of $7$ tin soldiers each? b) Who loses if they start with $M \ge 1$ companies consisting of $n_1 \ge 1, n_2 \ge 1, \dotsc, n_M \ge 1$ $(n_1+n_2+\dotsc+n_M=N)$ tin soldiers?

Consider $16$ points arranged as shown, with horizontal and vertical distances of $1$ between consecutive rows and columns. In how many ways can one choose four of these points such that the distance between every two of those four points is strictly greater than $2$? [asy] for (int x = 0; x < 4; ++x) { for (int y = 0; y < 4; ++y) { dot((x, y)); } } [/asy]

Points $A_1,B_1,C_1$ lie on sides $BC, CA, AB$ of an acute-angled triangle, respectively. Denote by $P, Q, R$ the intersections of $BB_1$ and $CC_1$, $CC_1$ and $AA_1$, $AA_1$ and $BB_1$. If triangle $PQR$ is similar to $ABC$ and $\angle AB_1C_1 = \angle BC_1A_1 = \angle CA_1B_1$, prove that $ABC$ is equilateral.

Let $\triangle ABC$ be an acute triangle with circumcenter $O$ such that $AB<AC$, let $Q$ be the intersection of the external bisector of $\angle A$ with $BC$, and let $P$ be a point in the interior of $\triangle ABC$ such that $\triangle BPA$ is similar to $\triangle APC$. Show that $\angle QPA + \angle OQB = 90^{\circ}$. [i]Alex Zhu.[/i]

Given a rectangular grid, split into $m\times n$ squares, a colouring of the squares in two colours (black and white) is called valid if it satisfies the following conditions: [list] [*]All squares touching the border of the grid are coloured black. [*]No four squares forming a $2\times 2$ square are coloured in the same colour. [*]No four squares forming a $2\times 2$ square are coloured in such a way that only diagonally touching squares have the same colour.[/list] Which grid sizes $m\times n$ (with $m,n\ge 3$) have a valid colouring?

a) $a,b,c,d$ are positive reals such that $abcd=1$. Prove that \[\sum_{cyc} \frac{1+ab}{1+a}\geq 4.\] (b)In a scalene triangle $ABC$, $\angle BAC =120^{\circ}$. The bisectors of angles $A,B,C$ meets the opposite sides in $P,Q,R$ respectively. Prove that the circle on $QR$ as diameter passes through the point $P$.

Let $p>0$ be a given parameter. Determine all real $x$ such that \[\frac{1}{\,x+\sqrt{p-x^2\,}\,}+\frac{1}{\,x-\sqrt{p-x^2\,}\,}\ge\frac{1}{\,p\,}.\]

Find all integers $x,y,z$ such that: $7^x+13^y=2^z$