Prove that, for all $n\in\mathbb{N}$, on $ [n-4\sqrt{n}, n+4\sqrt{n}]$ exists natural number $k=x^3+y^3$ where $x$, $y$ are nonnegative integers.

In the octagon below all sides have the length $1$ and all angles are equal. Determine the distance between the corners $A$ and $B$. [img]https://1.bp.blogspot.com/-i6TAFDvcQ8w/XzXCRhnV_kI/AAAAAAAAMVw/rKrQMfPYYJIaCwl8hhdVHdqO4fIn8O7cwCLcBGAsYHQ/s0/2011%2BMogh%2Bp2.png[/img]

If $n$ is a natural number, prove that the number $(n+1)(n+2)\cdots(n+10)$ is not a perfect square.

Length of sides of regular hexagon $ABCDEF$ is $a$. Two moving points $M,N$ moves on sides $BC,DE$, satisfy that $\angle MAN=\frac{\pi}{3}$. Prove that $AM\cdot AN-BM\cdot DN$ is a definite value.

Find all functions $ f:\mathbb{R}\longrightarrow\mathbb{R} $ that admit a primitive $ F $ defined as $ F(x)=\left\{\begin{matrix} f(x)/x, & x\neq 0 \\ 2007, & x=0 \end{matrix}\right. . $

An $8'\text{ X }10'$ table sits in the corner of a square room, as in Figure 1 below. The owners desire to move the table to the position shown in Figure 2. The side of the room is $S$ feet. What is the smallest integer value of $S$ for which the table can be moved as desired without tilting it or taking it apart? [asy] size(200); defaultpen(linewidth(0.7)+fontsize(10)); pair A=(0,0), B=(16,0), C=(16,16), D=(0,16), E=(32,0), F=(48,0), G=(48,16), H=(32,16), I=(0,8), J=(10,8), K=(10,16), L=(32,6), M=(40,6), N=(40,16); draw(A--B--C--D--A^^E--F--G--H--E^^I--J--K^^L--M--N); label("S", (18,8)); label("S", (50,8)); label("Figure 1", (A+B)/2, 2*S); label("Figure 2", (E+F)/2, 2*S); label("10'", (I+J)/2, S); label("8'", (12,12)); label("8'", (L+M)/2, S); label("10'", (42,11)); label("table", (5,12)); label("table", (36,11)); [/asy] $ \textbf{(A)}\ 11\qquad\textbf{(B)}\ 12\qquad\textbf{(C)}\ 13\qquad\textbf{(D)}\ 14\qquad\textbf{(E)}\ 15 $

[b]5.[/b] Denote by $c_n$ the $n$th positive integer which can be represented in the form $c_n = k^{l} (k,l = 2,3, \dots )$. Prove that $\sum_{n=1}^{\infty}\frac{1}{c_n-1}=1$ [b](N. 18)[/b]

Given is a trapezoid $ABCD$, $AD \parallel BC$. The angle bisectors of the two pairs of opposite angles meet at $X, Y$. Prove that $AXYD$ and $BXYC$ are cyclic.

In a rectangular box are a number of rectangular blocks, not necessarily identical to one another. Each block has one of its dimensions reduced. Is it always possible to pack these blocks in a smaller rectangular box, with the sides of the blocks parallel to the sides of the box? [i](6 points)[/i]

$11$ people are sitting around a circle table, orderly (means that the distance between two adjacent persons is equal to others) and $11$ cards with numbers $1$ to $11$ are given to them. Some may have no card and some may have more than $1$ card. In each round, one [and only one] can give one of his cards with number $ i $ to his adjacent person if after and before the round, the locations of the cards with numbers $ i-1,i,i+1 $ don’t make an acute-angled triangle. (Card with number $0$ means the card with number $11$ and card with number $12$ means the card with number $1$!) Suppose that the cards are given to the persons regularly clockwise. (Mean that the number of the cards in the clockwise direction is increasing.) Prove that the cards can’t be gathered at one person.

A circle through the vertices $A$ and $B$ of $\triangle ABC$ intersects segments $AC$ and $BC$ at points $P$ and $Q$ respectively. If $AQ=AC$, $\angle BAQ=\angle CBP$ and $AB=(\sqrt{3}+1)PQ$, find the measures of the angles of $\triangle ABC$.

We are given tiles in the form of right angled triangles having perpendicular sides of length $1$ cm and $2$ cm. Is it possible to form a square from $20$ such tiles? ( S . Fomin , Leningrad)

Determine all pairs $(x,y)$ of natural numbers, such that the numbers $\frac{x+1}{y}$ and $\frac{y+1}{x}$ are natural.

If $ m,n\in Z$, then $ m^{2} \plus{} 3mn \minus{} 4n^{2}$ cannot be $\textbf{(A)}\ 69 \qquad\textbf{(B)}\ 76 \qquad\textbf{(C)}\ 91 \qquad\textbf{(D)}\ 94 \qquad\textbf{(E)}\ \text{None}$

Let $ n \ge 1$ and $ k \ge 3$ be integers. A circle is divided into $ n$ sectors $ a_1,a_2,\dots,a_n$. We will color the $ n$ sectors with $ k$ different colors such that $ a_i$ and $ a_{i \plus{} 1}$ have different color for each $ i \equal{} 1,2,\dots,n$ where $ a_{n \plus{} 1}\equal{}a_1$. Find the number of ways to do such coloring.

For each $1\leq i\leq 9$ and $T\in\mathbb N$, define $d_i(T)$ to be the total number of times the digit $i$ appears when all the multiples of $1829$ between $1$ and $T$ inclusive are written out in base $10$. Show that there are infinitely many $T\in\mathbb N$ such that there are precisely two distinct values among $d_1(T)$, $d_2(T)$, $\dots$, $d_9(T)$.

A jar contains $97$ marbles that are either red, green, or blue. Neil draws two marbles from the jar without replacement and notes that the probability that they would be the same color is $\tfrac{5}{12}.$ After Neil puts his marbles back, Jerry draws two marbles from the jar with replacement. Compute the probability that the marbles that Jerry draws are the same color.

Integers $x,y,z$ and $a,b,c$ satisfy $$x^2+y^2=a^2,\enspace y^2+z^2=b^2\enspace z^2+x^2=c^2.$$Prove that the product $xyz$ is divisible by (a) $5$, and (b) $55$.

Let ABCD be a quadrilateral; X and Y be the midpoints of AC and BD respectively and lines through X and Y respectively parallel to BD, AC meet in O. Let P,Q,R,S be the midpoints of AB, BC, CD, DA respectively. Prove that (A) APOS and APXS have the same area (B) APOS, BQOP, CROQ, DSOR have the same area.

Let $ABCDEF$ be a regular hexagon and $P$ be a point on the shorter arc $EF$ of its circumcircle. Prove that the value of $$\frac{AP+BP+CP+DP}{EP+FP}$$is constant and find its value.

The vertices of a regular $2005$-gon are colored red, white and blue. Whenever two vertices of different colors stand next to each other, we are allowed to recolor them into the third color. (a) Prove that there exists a finite sequence of allowed recolorings after which all the vertices are of the same color. (b) Is that color uniquely determined by the initial coloring?

The infinity sequence $r_{1},r_{2},...$ of rational numbers it satisfies that: $\prod_{i=1}^ {k}r_{i}=\sum_{i=1}^{k} r_{i}$. For all natural k. Show that $\frac{1}{r_{n}}-\frac{3}{4}$ is a square of rationale number for all natural $n\geq3$

An ant walks on the plane as follows: initially, it walks $1$ cm in any direction. After, at each step, it changes the trajectory direction by $60^o$ left or right and walks $1$ cm in that direction. It is possible that it returns to the point from which it started in (a) $2008$ steps? (b) $2009$ steps? [img]https://cdn.artofproblemsolving.com/attachments/8/b/d4c0d03c67432c4e790b465a74a876b938244c.png[/img]

In the acute-angled triangle $ABC$, on the lines $BC$, $AC$, $AB$ we consider the points $D$, $E$ and, respectively, $F$, such that $AD\perp AC, BE\perp AB, CF\perp AC$. Let the point $A', B', C'$ be such that $\{A'\}=BC\cap EF, \{B'\}=AC\cap DF, \{C'\}=AB\cap DE$. Prove that the following inequality is true $$\frac{A'F}{A'E} \cdot \frac{B'D}{B'F} \cdot \frac{C'E}{C'D}\geq8$$

Let $n > 1$ be an integer. In a circular arrangement of $n$ lamps $L_0, \ldots, L_{n-1},$ each of of which can either ON or OFF, we start with the situation where all lamps are ON, and then carry out a sequence of steps, $Step_0, Step_1, \ldots .$ If $L_{j-1}$ ($j$ is taken mod $n$) is ON then $Step_j$ changes the state of $L_j$ (it goes from ON to OFF or from OFF to ON) but does not change the state of any of the other lamps. If $L_{j-1}$ is OFF then $Step_j$ does not change anything at all. Show that: (i) There is a positive integer $M(n)$ such that after $M(n)$ steps all lamps are ON again, (ii) If $n$ has the form $2^k$ then all the lamps are ON after $n^2-1$ steps, (iii) If $n$ has the form $2^k + 1$ then all lamps are ON after $n^2 - n + 1$ steps.