Prove that there exists a positive integer $n$ such that $n^6 + 31n^4 - 900\vdots 2009 \cdot 2010 \cdot 2011$. (I. Losev, I. Voronovich)

Prove that for any positive integers $k$ and $N$, \[\left(\frac{1}{N}\sum\limits_{n=1}^{N}(\omega (n))^k\right)^{\frac{1}{k}}\leq k+\sum\limits_{q\leq N}\frac{1}{q},\] where $\sum\limits_{q\leq N}\frac{1}{q}$ is the summation over of prime powers $q\leq N$ (including $q=1$). Note: For integer $n>1$, $\omega (n)$ denotes number of distinct prime factors of $n$, and $\omega (1)=0$.

If $I$ is the incenter of a triangle $ABC$ and $R$ is the radius of its circumcircle then \[AI+BI+CI\leq 3R\]

Let $\Gamma$ be a semicircle with diameter $AB$. On this diameter is selected a point $C$, and on the semicircle are selected points $D$ and $E$ so that $E$ lies between $B$ and $D$. It turned out that $\angle ACD = \angle ECB$. The intersection point of the tangents to $\Gamma$ at points $D$ and $E$ is denoted by $F$. Prove that $\angle EFD=\angle ACD+ \angle ECB$.

For any positive integer $n$, define $\boxed{n}$ to be the sum of the positive factors of $n$. For example, $\boxed{6} = 1 + 2 + 3 + 6 = 12$. Find $\boxed{\boxed{11}}$. $\textbf{(A)}\ 13 \qquad \textbf{(B)}\ 20 \qquad \textbf{(C)}\ 24 \qquad \textbf{(D)}\ 28 \qquad \textbf{(E)}\ 30$

Give an example of four pairwise distinct natural numbers $a$, $b$, $c$ and $d$ such that $$a^2 + b^3 + c^4 = d^5.$$

A polygon $\prod$ is given in the $OXY$ plane and its area exceeds $n.$ Prove that there exist $n+1$ points $P_{1}(x_1, y_1), P_{2}(x_2, y_2), \ldots, P_{n+1}(x_{n+1}, y_{n+1})$ in $\prod$ such that $\forall i,j \in \{1, 2, \ldots, n+1\}$, $x_j - x_i$ and $y_j - y_i$ are all integers.

Let $ X$ be a set containing $ 2k$ elements, $ F$ is a set of subsets of $ X$ consisting of certain $ k$ elements such that any one subset of $ X$ consisting of $ k \minus{} 1$ elements is exactly contained in an element of $ F.$ Show that $ k \plus{} 1$ is a prime number.

Let $ABCD$ be a rectangle consisting of unit squares. All vertices of these unit squares inside the rectangle and on its sides have been colored in four colors. Additionally, it is known that: [list] [*] every vertex that lies on the side $AB$ has been colored in either the $1.$ or $2.$ color; [*] every vertex that lies on the side $BC$ has been colored in either the $2.$ or $3.$ color; [*] every vertex that lies on the side $CD$ has been colored in either the $3.$ or $4.$ color; [*] every vertex that lies on the side $DA$ has been colored in either the $4.$ or $1.$ color; [*] no two neighboring vertices have been colored in $1.$ and $3.$ color; [*] no two neighboring vertices have been colored in $2.$ and $4.$ color. [/list] Notice that the constraints imply that vertex $A$ has been colored in $1.$ color etc. Prove that there exists a unit square that has all vertices in different colors (in other words it has one vertex of each color).

In a convex hexagon $ABCDEF$ the triangles $BDF, ACE$ are equilateral and congruent. Prove that the three lines connecting the midpoints of opposite sides are concurrent.

Suppose all of the 200 integers lying in between (and including) 1 and 200 are written on a blackboard. Suppose we choose exactly 100 of these numbers and circle each one of them. By the [i]score[/i] of such a choice, we mean the square of the difference between the sum of the circled numbers and the sum of the non-circled numbers. What is the average scores over all possible choices for 100 numbers?

Show that, if $m$ and $n$ are non-zero integers of like parity, and $n^2 -1$ is divisible by $m^2 - n^2 + 1$, then $m^2 - n^2 + 1$ is the square of an integer. Amer. Math. Monthly

$3n$ points are given ($n\ge 1$) in the plane, each $3$ of them are not collinear. Prove that there are $n$ distinct triangles with the vertices those points.

Prove that for every positive integer $n$ holds inequality $\{n\sqrt{7}\}>\frac{3\sqrt{7}}{14n}$, where $\{x\}$ is fractional part of $x$.

In a rectangular prism with volume $24$, the sum of the lengths of its $12$ edges is $60$, and the length of each space diagonal is $\sqrt{109}$. Let the dimensions of the prism be $a\times b\times c$, such that $a>b>c$. Given that $a$ can be written as $\frac{p+\sqrt{q}}{r}$ where $p$, $q$, and $r$ are integers and $q$ is square-free, find $p+q+r$.

Suppose that $T,U:V\longrightarrow V$ are two linear transformations on the vector space $V$ such that $T+U$ is an invertible transformation. Prove that $TU=UT=0 \Leftrightarrow \operatorname{rank} T+\operatorname{rank} U=n$.

There are 365 cards with 365 different numbers. Each step, we can choose 3 cards $a_{i},a_{j},a_{k}$ and we know the order of them (examble: $a_{i}<a_{j}<a_{k}$). With 2000 steps, can we order 365 cards from smallest to biggest??

Let $n$ be a positive integer. Determine the smallest positive integer $k$ with the following property: it is possible to mark $k$ cells on a $2n \times 2n$ board so that there exists a unique partition of the board into $1 \times 2$ and $2 \times 1$ dominoes, none of which contain two marked cells.

Let $ABCDE$ be a convex pentagon such that $AE\parallel BC$ and $\angle ADE = \angle BDC$. The diagonals $AC$ and $BE$ intersect at point $F$. Prove that $\angle CBD= \angle ADF$.

Find all positive real solutions $(a, b, c)$ to the following system: $$ \begin{aligned} a^2 + \frac{b}{a} &= 8, \\ ab + c^2 &= 18, \\ 3a + b + c &= 9\sqrt{3}. \end{aligned} $$

How many rectangles are in the following figure? [asy] size(80); draw((0,0)--(3,0)--(3,4)--(0,4)--cycle); draw((0,2)--(3,2)); draw((0.75,2)--(0.75,0)); draw((2.25,2)--(2.25,0)); [/asy] $\textbf{(A) }5\qquad\textbf{(B) }6\qquad\textbf{(C) }7\qquad\textbf{(D) }8\qquad\textbf{(E) }9$

Arne and Berit are playing a game. They have chosen positive integers $m$ and $n$ with $n\geq 4$ and $m \leq 2n + 1$. Arne begins by choosing a number from the set $\{1, 2, \dots , n \}$, and writes it on a blackboard. Then Berit picks another number from the same set, and writes it on the board. They continue alternating turns, always choosing numbers that are not already on the blackboard. When the sum of all the numbers on the board exceeds or equals $m$, the game is over, and whoever wrote the last number has won. For which combinations of $m$ and $n$ does Arne have a winning strategy?

A student is playing computer. Computer shows randomly 2002 positive numbers. Game's rules let do the following operations - to take 2 numbers from these, to double first one, to add the second one and to save the sum. - to take another 2 numbers from the remainder numbers, to double the first one, to add the second one, to multiply this sum with previous and to save the result. - to repeat this procedure, until all the 2002 numbers won't be used. Student wins the game if final product is maximum possible. Find the winning strategy and prove it.

How many equilateral hexagons of side length $\sqrt{13}$ have one vertex at $(0,0)$ and the other five vertices at lattice points? (A lattice point is a point whose Cartesian coordinates are both integers. A hexagon may be concave but not self-intersecting.)

What condition should the angles of triangle $ ABC $ satisfy so that the bisector of angle $ A $, the median drawn from vertex $ B $ and the altitude drawn from vertex $ C $ intersect at one point?