NASA has proposed populating Mars with $2,004$ settlements. The only way to get from one settlement to another will be by a connecting tunnel. A bored bureaucrat draws on a map of Mars, randomly placing $N$ tunnels connecting the settlements in such a way that no two settlements have more than one tunnel connecting them. What is the smallest value of $N$ that guarantees that, no matter how the tunnels are drawn, it will be possible to travel between any two settlements?

Rectangle $ABCD$ has $AB = 8$ and $BC = 13$. Points $P_1$ and $P_2$ lie on $AB$ and $CD$ with $P_1P_2 \parallel BC$. Points $Q_1$ and $Q_2$ lie on $BC$ and $DA$ with $Q_1Q_2 \parallel AB$. Find the area of quadrilateral $P_1Q_1P_2Q_2$.

Solve the system $\begin{cases} (x^3 + y^3)(x^2 + y^2) = 2b^5 \\ x + y = b \end{cases}$ in $C$

Determine all real $x$ satisfying $$\frac{1}{\sin^2 x} -\frac{1}{\cos^2x} \ge \frac83.$$

Let $ABCD$ be a parallelogram. Points $P$ and $Q$ lie inside $ABCD$ such that $\bigtriangleup ABP$ and $\bigtriangleup{BCQ}$ are equilateral. Prove that the intersection of the line through $P$ perpendicular to $PD$ and the line through $Q$ perpendicular to $DQ$ lies on the altitude from $B$ in $\bigtriangleup{ABC}$.

Let $\omega$ be a circle on the plane. Let $\omega_1$ and $\omega_2$ be circles which are internally tangent to $\omega$ at points $A$ and $B$ respectively. Let the centers of $\omega_1$ and $\omega_2$ be $O_1$ and $O_2$ respectively and let the intersection points of $\omega_1$ and $\omega_2$ be $X$ and $Y$. Assume that $X$ lies on the line $AB$. Let the common external tangent of $\omega_1$ and $\omega_2$ that is closer to point $Y$ be tangent to the circles $\omega_1$ and $\omega_2$ at $K$ and $L$ respectively. Let the second intersection point of the line $AK$ and $\omega$ be $P$ and let the second intersection point of the circumcircle of $PKL$ and $\omega$ be $S$. Let the circumcenter of $AKL$ be $Q$ and let the intersection points of $SQ$ and $O_1O_2$ be $R$. Prove that $$\frac{\overline{O_1R}}{\overline{RO_2}}=\frac{\overline{AX}}{\overline{XB}}$$

Find all $7$-digit numbers which are multiples of $21$ and which have each digit $3$ or $7$.

Find all rational solutions of \[a^2 + c^2 + 17(b^2 + d^2) = 21,\]\[ab + cd = 2.\]

If \[\frac{1}{1+2} + \frac{1}{1+2+3} + \ldots + \frac{1}{1+2 + \ldots + 20} = \frac{m}{n}\] where $m$ and $n$ are positive integers with no common divisor, find $m + n$.

Let $ABC$ be a acute-angle triangle and $X$ be point in the plane of this triangle. Let $M,N,P$ be the orthogonal projections of $X$ in the lines that contains the altitudes of this triangle Determine the positions of the point $X$ such that the triangle $MNP$ is congruent to $ABC$

Let $n$ be a positive integer. Find all polynomials $P$ with real coefficients such that $$P(x^2+x-n^2)=P(x)^2+P(x)$$ for all real numbers $x$.

Let $ABC$ be an acute triangle. The arcs $AB$ and $AC$ of the circumcircle of the triangle are reflected over the lines AB and $AC$, respectively. Prove that the two arcs obtained intersect in another point besides $A$.

Let $ABC$ be an acute triangle with $AC>AB$, Let $DEF$ be the intouch triangle with $D \in (BC)$,$E \in (AC)$,$F \in (AB)$,, let $G$ be the intersecttion of the perpendicular from $D$ to $EF$ with $AB$, and $X=(ABC)\cap (AEF)$. Prove that $B,D,G$ and $X$ are concylic

Find all positive integers $x, y, z$ that satisfy the conditions: $$[x,y,z] =(x,y)+(y,z) + (z,x), x\le y\le z, (x,y,z) = 1$$ The symbols $[m,n]$ and $(m,n)$ respectively represent positive integers, the least common multiple and the greatest common divisor of $m$ and $n$.

We draw a radius of a circle. We draw a second radius $23$ degrees clockwise from the first radius. We draw a third radius $23$ degrees clockwise from the second. This continues until we have drawn $40$ radii each $23$ degrees clockwise from the one before it. What is the measure in degrees of the smallest angle between any two of these $40$ radii?

Find the maximum value of the positive real number $k$ such that the inequality $$\frac{1}{kab+c^2} +\frac{1} {kbc+a^2} +\frac{1} {kca+b^2} \geq \frac{k+3}{a^2+b^2+c^2} $$holds for all positive real numbers $a,b,c$ such that $a^2+b^2+c^2=2(ab+bc+ca).$

Find all positive integers $a$ and $b$ such that \[\frac{a^{2}+b}{b^{2}-a}\text{ and }\frac{b^{2}+a}{a^{2}-b}\] are both integers.

There are several candles of the same size on the Chapel of Bones. On the first day a candle is lit for a hour. On the second day two candles are lit for a hour, on the third day three candles are lit for a hour, and successively, until the last day, when all the candles are lit for a hour. On the end of that day, all the candles were completely consumed. Find all the possibilities for the number of candles.

An arithmetical progression (whose difference is not equal to zero) consists of natural numbers without any nines in its decimal notation. (a) Prove that the number of its terms is less than $100$. (b) Give an example of such a progression with $72$ terms. (c) Prove that the number of terms in any such progression does not exceed $72$. (V. Bugaenko and Tarasov, Moscow)

In an acute-angled triangle $ABC$ the interior bisector of angle $A$ meets $BC$ at $L$ and meets the circumcircle of $ABC$ again at $N$. From $L$ perpendiculars are drawn to $AB$ and $AC$, with feet $K$ and $M$ respectively. Prove that the quadrilateral $AKNM$ and the triangle $ABC$ have equal areas.[i](IMO Problem 2)[/i] [i]Proposed by Soviet Union.[/i]

Let $p, q, r$ be primes and let $n$ be a positive integer such that $p^n + q^n = r^2$. Prove that $n = 1$. Laurentiu Panaitopol

Suppose $\{x_n\}$ is a decreasing sequence that $\displaystyle\lim_{n \rightarrow\infty}x_n=0$. Prove that $\sum(-1)^nx_n$ is convergent

Let $ 1\leq a,b,c,d,e,f,g,h,k \leq 9 $ and $ a,b,c,d,e,f,g,h,k $ are different integers, find the minimum value of the expression $ E = a*b*c+d*e*f+g*h*k $ and prove that it is minimum.

There are $m \geq 3$ positive integers, not necessarily distinct, that are arranged in a circle so that any positive integer divides the sum of its neighbours. Show that if there is exactly one $1$, then for any positive integer $n$, there are at most $\phi(n)$ copies of $n$. [i]Proposed By- (usjl, adapted from 2014 Taiwan TST)[/i]

Find the coefficient of $x^2$ in the following polynomial $$(1 -x)^2(1 + 2x)^2(1 - 3x)^2... (1 -11x)^2.$$