Non-zero numbers $a$ and $b$ satisfy the equality $$a^2b^2(a^2b^2 + 4) = 2(a^6 + b^6).$$Prove that at least one of them is irrational.

In a certain city, exactly 3 streets converge at any intersection. The streets are painted in three colors so that they converge at each intersection streets of three different colors. Three roads leave the city. Prove that they have different colors.

What is the smallest number of sides that an polygon can have (not necessarily convex), which can be cut into parallelograms?

Two pirates divide the loot, consisting of two bags of coins and a diamond, according to the following rules. First the first pirate takes take a few coins from any bag and transfer them from this bag in the other the same number of coins. Then the second pirate does the same (choosing the bag from which he takes the coins at his discretion) and etc. until you can take coins according to these rules. The pirate who takes the coins last gets the diamond. Who will get the diamond if is each of the pirates trying to get it? Give your answer depending on the initial number of coins in the bags.

Given are $8$ weights weighing $1, 2, . . . , 8$ grams, but it is not known which one how much does it weigh. Baron Munchausen claims that he remembers which of the weights weighs how much, and to prove that he is right he is ready to conduct one weighing, as a result of which the weight of at least one of the weights will be unambiguously established. Is he cheating?

The electric train traveled from platform A to platform B in $X$ minutes ($0< X<60$). Find $X$ if it is known that as at the moment departure from A, and at the time of arrival at B, the angle between hourly and the minute hand was equal to $X$ degrees.

Angle bisectors $AD$ and $CE$ of triangle $ABC$ intersect at point $O$. A line symmetrical to $ AB$ with respect to $CE$ intersects the line symmetric $BC$ with respect to $AD$, at point $K$. Prove that $KO \perp AC$.

There are 2000 cities in the country. Every city is connected by non-stop two-way airlines with some other cities, and for each city, the number of airlines originating from it is a factor of two. (i.e. $1$, $2$, $4$, $8$, $...$). For each city $A$, the statistician calculated the number routes with no more than one transfer connecting $A$ with other cities, and then summed up the results for all $2000$ cities. He got $100,000$. Prove that the statistician was wrong.

Misha solved the equation $x^2 + ax + b = 0$ and told Dima the set of four numbers - two roots and two coefficients of this equation (but not said which of them are roots and which are coefficients). Will he be able to Dima, find out what equation Misha solved if all the numbers in the set turned out to be different?

Are there different mutually prime natural numbers $a$, $b$ and $c$, greater than $1$, such that $2a + 1$ is divisible by $b$, $2b + 1$ is divisible by $c$ and $2c + 1$ is divisible by $a$?

There are $2n+1$ segments on the line. Any segment intersects at with at least $n$ others. Prove that there is a segment that intersects all the others.

Circles $S_1$ and $S_2$ intersect at points $M$ and $N$. Through point $A$ of circle $S_1$, draw straight lines $AM$ and $AN$ intersecting $S_2$ at points $B$ and $C$, and through point $D$ of circle $S_2$, draw straight lines $DM$ and $DN$ intersecting $S_1$ at points $E$ and $F$, and $A$, $E$, $F$ lie along one side of line $MN$, and $D$, $B$, $C$ lie on the other side (see figure). Prove that if $AB = DE$, then points $A$, $F$, $C$ and $D$ lie on the same circle, the position of the center of which does not depend on choosing points $A$ and $D$.

In a $99\times 101$ table , cubes of natural numbers, as shown in figure . Prove that the sum of all numbers in the table are divisible by $200$.

Among $2000$ outwardly indistinguishable balls, wines - aluminum weighing 1$0$ g, and the rest - duralumin weighing $9.9$ g. It is required to select two piles of balls so that the masses of the piles are different, and the number of balls in them - the same. What is the smallest number of weighings on a cup scale without weights that can be done?

On side $AB$ of triangle $ABC$, point $D$ is selected. Circle circumscribed around triangle $BCD$, intersects side $AC$ at point $M$, and the circumcircle of triangle $ACD$ intersects the side $BC$ at point $ N$ ($M,N \ne C$). Let $O$ be the circumcenter of the triangle $CMN$. Prove that line $OD$ is perpendicular to side $AB$.

The cells of the $200 \times 200$ table are painted black and white so that there are $404$ more black cells than white ones. Prove that there is a $2 \times 2$ square in which the number of white cells is odd.

$2000$ numbers are considered: $11, 101, 1001, . . $. Prove that at least $99\%$ of these numbers are composite.

Among five outwardly identical coins, $3$ are real and two are fake, identical in weight, but it is unknown whether they are heavier or lighter than the real ones. How to find at least one real coin in the least number of weighings?

Given a parallelogram $ABCD$ with angle $A$ equal to $60^o$. Point $O$ is the the center of a circle circumscribed around triangle $ABD$. Line $AO$ intersects the bisector of the exterior angle $C$ at point $K$. Find the ratio $AO/OK$.

For what smallest $n$ can a $n \times n$ square be cut into squares $40 \times 40$ and $49 \times 49$ so that squares of both types are present?

Is there a function $f(x)$ defined for all $x \in R$ and for all $x, y \in R $ satisfying the inequality $$|f(x + y) + \sin x + \sin y| < 2?$$

Given a natural number $a_0$, we construct the sequence $\{a_n\}$ as follows $a_{n+1} = a^2_n-5$ if $a_n$ is odd, and $\frac{a_n}{2}$ if $a_n$ is even. Prove that for any odd $a_0 > 5$ in the sequence $\{a_n\}$ arbitrarily large numbers will occur.

In a convex quadrilateral $ABCD$ we draw the bisectors $\ell_a$, $\ell_b$, $\ell_c$, $\ell_d$ of external angles $A$, $B$, $C$, $D$ respectively. The intersection points of the lines $\ell_a$ and $\ell_b$, $\ell_b$ and $\ell_c$, $\ell_c$ and $\ell_d$, $\ell_d$ and $\ell_a$ are designated by $K$, $L$, $M$, $N$. It is known that $3$ perpendiculars drawn from $K$ on $AB$, from $L$ om $BC$, from $M$ on $CD$ intersect at one point. Prove that the quadrilateral $ABCD$ is cyclic.

There are $2000$ cities in the country, some pairs of cities are connected by roads. It is known that no more than $N$ different non-self-intersecting cyclic routes of odd length. Prove that the country can be divided into $2N +2$ republics so that no two cities from the same republic are connected by a road.

Prove that it is possible to choose different real numbers $a_1, a_2, . . . , a_{10}$ that the equation $$(x - a_1)(x -a_2).... (x -a_{10}) = (x + a_1)(x + a_2) ...(x + a_{10})$$will have exactly $5$ different real roots.

The height and radius of the base of the cylinder are equal to $1$. What is the smallest number of balls of radius $1$ that can cover the entire cylinder?

Sequence of real numbers $a_1, a_2, . . . , a_{2000}$ is such that for any natural number $n$, $1\le n \le 2000$, the equality $$a^3_1+ a^3_2+... + a^3_n = (a_1 + a_2 +...+ a_n)^2.$$Prove that all terms of this sequence are integers.

For non-negative numbers $x$ and $y$ not exceeding $1$, prove that $$\frac{1}{\sqrt{1+x^2}}+\frac{1}{\sqrt{1+y^2}} \le \frac{2}{\sqrt{1 + xy}},$$

A circle inscribed in triangle $ABC$ has center $O$ and touches side $AC$ at point $K$. A second circle also has center $O$, intersects all sides of triangle $ABC$. Let $E$ and $F$ be the corresponding points of intersection with sides $AB$ and $BC$, closest to vertex $B$; $B_1$ and $B_2$ are the points of its intersection with side $AC$, and $B_1$ is closer to $A$. Prove that points $B$, $K$ and point $P$, the intersections of the segments $B_2E$ and $B_1F$ lie on the same straight line.

Given numbers $1, 2, . . .,N$, each of which is colored either black or white. It is allowed to repaint it in the opposite direction color any three numbers, one of which is equal to half the sum of the other two. At which $N$ numbers can always be made white?

There are $2000$ cities in the country, some pairs of cities are connected by roads. It is known that no more than $N$ different non-self-intersecting cyclic routes of odd length. Prove that the country can be divided into $N + 2$ republics so that no two cities from the same republic are connected by a road.