Determine all positive integers $n$, such that the equation $2 \sin nx = \tan x + \cot x$ has solutions in real numbers $x$.

Find all positive integers $m$ for which $2001\cdot S (m) = m$ where $S(m)$ denotes the sum of the digits of $m$.

A rectangle $\mathcal{R}$ with odd integer side lengths is divided into small rectangles with integer side lengths. Prove that there is at least one among the small rectangles whose distances from the four sides of $\mathcal{R}$ are either all odd or all even. [i]Proposed by Jeck Lim, Singapore[/i]

Let $M$ be a finite set of real numbers with the following property: From three different elements of $M$ can always be chosen two whose sum is located in $M$. How many elements can $M$ have at most?

Let $d$ be a real number such that every non-degenerate quadrilateral has at least two interior angles with measure less than $d$ degrees. What is the minimum possible value for $d$?

Prove that for each positive integer n,the equation $x^{2}+15y^{2}=4^{n}$ has at least $n$ integer solution $(x,y)$

In the expansion of \[ \left(1 \plus{} x \plus{} x^2 \plus{} \cdots \plus{} x^{27}\right)\left(1 \plus{} x \plus{} x^2 \plus{} \cdots \plus{} x^{14}\right)^2, \]what is the coefficient of $ x^{28}$? $ \textbf{(A)}\ 195 \qquad \textbf{(B)}\ 196 \qquad \textbf{(C)}\ 224 \qquad \textbf{(D)}\ 378 \qquad \textbf{(E)}\ 405$

$8$ girls and $25$ boys stand in a circle. Between two girls, there are at least two boys. So, we have________ways.

Let $a_1,a_2,a_3,a_4$ be positive real numbers satisfying \[\sum_{i<j}a_ia_j=1.\]Prove that \[\sum_{\text{sym}}\frac{a_1a_2}{1+a_3a_4}\geq\frac{6}{7}.\][i]* * *[/i]

For every $n$, the decreasing sequence $\{x_k\}$ satisfies a condition $$x_1+x_4/2+x_9/3+...+x_n^2/n \le 1$$ Prove that for every $n$, it also satisfies $$x_1+x_2/2+x_3/3+...+x_n/n\le 3$$

Let $\triangle ABC$ be inscribed in circle $O$ with $\angle ABC = 36^\circ$. $D$ and $E$ are on the circle such that $\overline{AD}$ and $\overline{CE}$ are diameters of circle $O$. List all possible positive values of $\angle DBE$ in degrees in order from least to greatest. [i]Proposed by Ambrose Yang[/i]

Find all positive integers $k$ such that for any positive integer $n$, $2^{(k-1)n+1}$ does not divide $\frac{(kn)!}{n!}$.

Does there exist a set of $2020$ distinct positive whole numbers with the property that the product of any $101$ of them is divisible by the sum of those $101$ numbers?

Let $E$ be the midpoint of the side $CD$ of a square $ABCD$. Consider the point $M$ inside the square such that $\angle MAB = \angle MBC = \angle BME = x$. Find the angle $x$.

Let $K$ be an odd number st $S_2{(K)} = 2$ and let $ab=K$ where $a,b$ are positive integers. Show that if $a,b>1$ and $l,m >2$ are positive integers st:$S_2{(a)} < l$ and $S_2{(b)} < m$ then : $$K \leq 2^{lm-6} +1$$ ($S_2{(n)}$ is the sum of digits of $n$ written in base 2)

Prove that $ \left\{ (x,y)\in\mathbb{C}^2 |x^2+y^2=1 \right\} =\{ (1,0)\}\cup \left\{ \left( \frac{z^2-1}{z^2+1} ,\frac{2z}{z^2+1} \right) | z\in\mathbb{C}\setminus \{\pm \sqrt{-1}\} \right\} . $

Let $a,b,c,d$ be four [b]distinct [/b]integers such that: $$\text{min}(a,b)=2$$ $$\text{min}(b,c)=0$$ $$\text{max}(a,c)=2$$ $$\text{max}(c,d)=4$$ Here $\text{min}(a,b)$ and $\text{max}(a,b)$ denote respectively the minimum and the maximum of two numbers $a$ and $b$. Determine the fifth smallest possible value for $a+b+c+d$

Prove that exists integer $n > 2003$ that in sequence $\binom{n}{0}$, $\binom{n}{1}$, $\binom{n}{2}$, ..., $\binom{n}{2003}$ each element is a divisor of all elements which are after him.

Let $n \ge 3$ be an integer, and consider a circle with $n + 1$ equally spaced points marked on it. Consider all labellings of these points with the numbers $0, 1, ... , n$ such that each label is used exactly once; two such labellings are considered to be the same if one can be obtained from the other by a rotation of the circle. A labelling is called [i]beautiful[/i] if, for any four labels $a < b < c < d$ with $a + d = b + c$, the chord joining the points labelled $a$ and $d$ does not intersect the chord joining the points labelled $b$ and $c$. Let $M$ be the number of beautiful labelings, and let N be the number of ordered pairs $(x, y)$ of positive integers such that $x + y \le n$ and $\gcd(x, y) = 1$. Prove that $$M = N + 1.$$

For every natural number $n$ prove that $$\left( 1+ \frac12 + ...+ \frac1n \right)^2+ \left( \frac12 + ...+ \frac1n \right)^2+...+ \left( \frac{1}{n-1} + \frac12 \right)^2+ \left( \frac1n \right)^2=2n- \left( 1+ \frac12 + ...+ \frac1n \right)$$ (S. Manukian, Yerevan)

Consider a $100\times 100$ square unit lattice $\textbf{L}$ (hence $\textbf{L}$ has $10000$ points). Suppose $\mathcal{F}$ is a set of polygons such that all vertices of polygons in $\mathcal{F}$ lie in $\textbf{L}$ and every point in $\textbf{L}$ is the vertex of exactly one polygon in $\mathcal{F}.$ Find the maximum possible sum of the areas of the polygons in $\mathcal{F}.$ [i]Michael Ren and Ankan Bhattacharya, USA[/i]

Solve the equation $\sqrt{1+\sqrt {1+x}}=\sqrt[3]{x}$ for $x \ge 0$.

A right square pyramid with volume $54$ has a base with side length $6.$ The five vertices of the pyramid all lie on a sphere with radius $\frac mn$, where $m$ and $n$ are relatively prime positive integers. Find $m+n$.

Prove that in the Euclidean plane every regular polygon having an even number of sides can be dissected into lozenges. (A lozenge is a quadrilateral whose four sides are all of equal length).

Find the last three digits of the number $2003^{{2002}^{2001}}$.