Let $d(n)$ be the number of divisors of $n,$ where $n$ is a natural number. Prove that the natural numbers can be colured by 2 colours in such way, that for any infinite increasing sequence $\left\{a_{1}, a_{2}, \cdots\right\}$ if $\left\{d\left(a_{1}\right), d\left(a_{2}\right), \cdots\right\}$ is an nonconstant geometric series then $\left\{a_{1}, a_{2}, \cdots\right\}$ does not bear same colour.

An integer $n\ge1$ is [i]good [/i] if the following property is satisfied: If a positive integer is divisible by each of the nine numbers $n + 1, n + 2, ..., n + 9$, this is also divisible by $n + 10$. How many good integers are $n\ge 1$?

Real numbers $a, b, c$ satisfy $(2b - a)^2 + (2b - c)^2 = 2(2b^2 - ac)$. Prove that $a + c = 2b$.

Let $ABCD$ be a convex quadrilateral such that $\angle ADB=\angle BDC$. Suppose that a point $E$ on the side $AD$ satisfies the equality \[AE\cdot ED + BE^2=CD\cdot AE.\] Show that $\angle EBA=\angle DCB$.

Let $ f$ and $ g$ be polynomials with rational coefficients, and let $ F$ and $ G$ denote the sets of values of $ f$ and $ g$ at rational numbers. Prove that $ F \equal{} G$ holds if and only if $ f(x) \equal{} g(ax \plus{} b)$ for some suitable rational numbers $ a\not \equal{} 0$ and $ b$. [i]E. Fried[/i]

In the plane we consider rectangles whose sides are parallel to the coordinate axes and have positive length. Such a rectangle will be called a [i]box[/i]. Two boxes [i]intersect[/i] if they have a common point in their interior or on their boundary. Find the largest $ n$ for which there exist $ n$ boxes $ B_1$, $ \ldots$, $ B_n$ such that $ B_i$ and $ B_j$ intersect if and only if $ i\not\equiv j\pm 1\pmod n$. [i]Proposed by Gerhard Woeginger, Netherlands[/i]

Points $ K,L,M,N$ are repectively the midpoints of sides $ AB,BC,CD,DA$ in a convex quadrliateral $ ABCD$.Line $ KM$ meets dioganals $ AC$ and $ BD$ at points $ P$ and $ Q$,respectively.Line $ LN$ meets dioganals $ AC$ and $ BD$ at points $ R$ and $ S$,respectively. Prove that if $ AP\cdot PC\equal{}BQ\cdot QD$,then $ AR\cdot RC\equal{}BS\cdot SD$.

Evaluate $ \int_0^1 \frac{(x^2\plus{}3x)e^x\minus{}(x^2\minus{}3x)e^{\minus{}x}\plus{}2}{\sqrt{1\plus{}x(e^x\plus{}e^{\minus{}x})}}\ dx$.

Show that if $ h_A, h_B,$ and $ h_C$ are the altitudes of $ \triangle ABC$, and $ r$ is the radius of the incircle, then $$ h_A + h_B + h_C \ge 9r$$

Find all functions $f: \mathbb{R}^+\to\mathbb{R}^+$ such that \[f(x+f(y+xy))=(y+1)f(x+1)-1\]for all $x,y\in\mathbb{R}^+$. ($\mathbb{R}^+$ denotes the set of positive real numbers.)

Let points $A,B,$ and $C$ lie on a line such that $AB=1, BC=1,$ and $AC=2.$ Let $C_1$ be the circle centered at $A$ passing through $B,$ and let $C_2$ be the circle centered at $A$ passing through $C.$ Find the area of the region outside $C_1,$ but inside $C_2.$

Find the sum of all the integers $N > 1$ with the properties that the each prime factor of $N $ is either $2, 3,$ or $5,$ and $N$ is not divisible by any perfect cube greater than $1.$

$ A_1$, $ B_1$ and $ C_1$ are the projections of the vertices $ A$, $ B$ and $ C$ of triangle $ ABC$ on the respective sides. If $ AB \equal{} c$, $ AC \equal{} b$, $ BC \equal{} a$ and $ AC_1 \equal{} 2t AB$, $ BA_1 \equal{} 2rBC$, $ CB_1 \equal{} 2 \mu AC$. Prove that: \[ \frac {a^2}{b^2} \cdot \left( \frac {t}{1 \minus{} 2t} \right)^2 \plus{} \frac {b^2}{c^2} \cdot \left( \frac {r}{1 \minus{} 2r} \right)^2 \plus{} \frac {c^2}{a^2} \cdot \left( \frac {\mu}{1 \minus{} 2\mu} \right)^2 \plus{} 16tr \mu \geq 1 \]

Let $r$ be the radius of the inscribed circle of a right triangle $ABC$. Show that $r$ is less than half of either leg and less than one fourth of the hypotenuse.

Positive integer $k$ and $k$ colors are given. We will say that a set of $2k$ points on a plane is $colorful$, if it contains exactly 2 points of each color and if lines connecting every two points of the same color are pairwise distinct. Find, in terms of $k$ the least integer $n\geq 2$ such that: in every set of $nk$ points of a plane, no three of which are collinear, consisting of $n$ points of every color there exists a $colorful$ subset.

The Poincare plane is a half-plane bounded by a line $R$. The lines are taken to be (1) the half-lines perpendicular to $R$, and (2) the semicircles with center on $R$. Show that given any line $L$ and any point $P$ not on $L$, there are infinitely many lines through $P$ which do not intersect $L$. Show that if $ ABC$ is a triangle, then the sum of its angles lies in the interval $(0, \pi)$.

[b]Problem 1[/b] : Find the smallest positive integer $n$, such that $\sqrt[5]{5n}$, $\sqrt[6]{6n}$ , $\sqrt[7]{7n}$ are integers.

Regular tetrahedron $ABCD$ has center $O$ and side length $1$. Points $A'$, $B'$, $C'$, and $D'$ are defined by reflecting $A$, $B$, $C$, and $D$ about $O$. Compute the volume of the polyhedron with vertices $ABCDA'B'C'D'$.

Let $ABC$ be an isosceles triangle with $AB = AC$. Let $D, E$ and $F$ be points on line segments $BC, CA$ and $AB$, respectively, such that $BF = BE$ and such that $ED$ is the angle bisector of $\angle BEC$. Prove that $BD = EF$ if and only if $AF = EC$.

Find all polynomials $P$ with integer coefficients which satisfy the property that, for any relatively prime integers $a$ and $b$, the sequence $\{P (an + b) \}_{n \ge 1}$ contains an infinite number of terms, any two of which are relatively prime.

[color=darkred]On a table there are $k\ge 2$ piles having $n_1,n_2,\ldots,n_k$ pencils respectively. A [i]move[/i] consists in choosing two piles having $a$ and $b$ pencils respectively, $a\ge b$ and transferring $b$ pencils from the first pile to the second one. Find the necessary and sufficient condition for $n_1,n_2,\ldots,n_k$ , such that there exists a succession of moves through which all pencils are transferred to the same pile.[/color]

Prove that for all triangle $\triangle ABC$ holds the following inequality $$\sum \limits_{cyc} \left (1-\sqrt{\sqrt{3}\tan \frac{A}{2}}+\sqrt{3}\tan \frac{A}{2}\right )\left (1-\sqrt{\sqrt{3}\tan \frac{B}{2}}+\sqrt{3}\tan \frac{B}{2}\right )\geq 3$$

A circle is circumscribed around an isosceles triangle $ABC$ with base $BC$. The bisector of the angle $C$ and the bisector of the angles $A$ intersect the circle at the points $E$ and $D$, respectively, and the segment $DE$ intersects the sides $BC$ and $AB$ at the points $P$ and $Q$, respectively. Reconstruct $\vartriangle ABC$ given points $D, P, Q$, if it is known in which half-plane relative to the line $DQ$ lies the vertex $A$. (Maria Rozhkova)

A one-person game with two possible outcomes is played as follows: After each play, the player receives either $a$ or $b$ points, where $a$ and $b$ are integers with $0 < b < a < 1986$. The game is played as many times as one wishes and the total score of the game is defined as the sum of points received after successive plays. It is observed that every integer $x \geq 1986$ can be obtained as the total score whereas $1985$ and $663$ cannot. Determine $a$ and $b.$

Let $n$ be a positive integer, and let Pushover be a game played by two players, standing squarely facing each other, pushing each other, where the first person to lose balance loses. At the HMPT, $2^{n+1}$ competitors, numbered $1$ through $2^{n+1}$ clockwise, stand in a circle. They are equals in Pushover: whenever two of them face off, each has a $50\%$ probability of victory. The tournament unfolds in $n+1$ rounds. In each rounjd, the referee randomly chooses one of the surviving players, and the players pair off going clockwise, starting from the chosen one. Each pair faces off in Pushover, and the losers leave the circle. What is the probability that players $1$ and $2^n$ face each other in the last round? Express your answer in terms of $n$.