There are $n$ pieces on the squares of a $5 \times 9$ board, at most one on each square at any time during the game. A move in the game consists of simultaneously moving each piece to a neighboring square by side, under the restriction that a piece having been moved horizontally in the previous move must be moved vertically and vice versa. Find the greatest value of $n$ for which there exists an initial position starting at which the game can be continued until the end of the world.

Let $1,\alpha_1,\alpha_2,...,\alpha_{10}$ be the roots of the polynomial $x^{11}-1$. It is a fact that there exists a unique polynomial of the form $f(x) = x^{10}+c_9x^9+ \dots + c_1x$ such that each $c_i$ is an integer, $f(0) = f(1) = 0$, and for any $1 \leq i \leq 10$ we have $(f(\alpha_i))^2 = -11$. Find $\left|c_1+2c_2c_9+3c_3c_8+4c_4c_7+5c_5c_6\right|$.

Let $p$ be a prime. Define $f_n(k)$ to be the number of positive integers $1\leq x\leq p-1$ such that $$\left(\left\{\frac{x}{p}\right\}-\left\{\frac{k}{p}\right\}\right)\left(\left\{\frac{nx}{p}\right\}-\left\{\frac{k}{p}\right\}\right)<0.$$ Let $a_n=f_n\left(\frac 12\right)+f_n\left(\frac 32\right)+\dots+f_n\left(\frac{2p-1}{2}\right)$, find $\min\{a_2, a_3, \dots, a_{p-1}\}$.

[asy] size(5cm); defaultpen(fontsize(6pt)); draw((0,0)--(4,0)--(4,4)--(0,4)--cycle); draw((0,0)--(-4,0)--(-4,-4)--(0,-4)--cycle); draw((1,-1)--(1,3)--(-3,3)--(-3,-1)--cycle); draw((-1,1)--(-1,-3)--(3,-3)--(3,1)--cycle); draw((-4,-4)--(0,-4)--(0,-3)--(3,-3)--(3,0)--(4,0)--(4,4)--(0,4)--(0,3)--(-3,3)--(-3,0)--(-4,0)--cycle, red+1.2); label("1", (-3.5,0), S); label("2", (-2,0), S); label("1", (-0.5,0), S); label("1", (3.5,0), S); label("2", (2,0), S); label("1", (0.5,0), S); label("1", (0,3.5), E); label("2", (0,2), E); label("1", (0,0.5), E); label("1", (0,-3.5), E); label("2", (0,-2), E); label("1", (0,-0.5), E); [/asy] Compute the area of the resulting shape, drawn in red above. [i]Proposed by Nathan Xiong[/i]

See all the problems from 5-th Kyiv math festival [url=http://www.mathlinks.ro/Forum/viewtopic.php?p=506789#p506789]here[/url] Triangle $ABC$ and straight line $l$ are given at the plane. Construct using a compass and a ruler the straightline which is parallel to $l$ and bisects the area of triangle $ABC.$

The $ 2007\ \text{AMC}\ 12$ contests will be scored by awarding $ 6$ points for each correct response, $ 0$ points for each incorrect response, and $ 1.5$ points for each problem left unanswered. After looking over the $ 25$ problems, Sarah has decided to attempt the first $ 22$ and leave the last three unanswered. How many of the first $ 22$ problems must she solve correctly in order to score at least $ 100$ points? $ \textbf{(A)}\ 13 \qquad \textbf{(B)}\ 14 \qquad \textbf{(C)}\ 15 \qquad \textbf{(D)}\ 16 \qquad \textbf{(E)}\ 17$

Let $d(n)$ be the number of positive divisors of a natural number $n$.Find all $k\in \mathbb{N}$ such that there exists $n\in \mathbb{N}$ with $d(n^2)/d(n)=k$.

Let $\Gamma_1$, $\Gamma_2$, $\Gamma_3$, $\Gamma_4$ be distinct circles such that $\Gamma_1$, $\Gamma_3$ are externally tangent at $P$, and $\Gamma_2$, $\Gamma_4$ are externally tangent at the same point $P$. Suppose that $\Gamma_1$ and $\Gamma_2$; $\Gamma_2$ and $\Gamma_3$; $\Gamma_3$ and $\Gamma_4$; $\Gamma_4$ and $\Gamma_1$ meet at $A$, $B$, $C$, $D$, respectively, and that all these points are different from $P$. Prove that \[ \frac{AB\cdot BC}{AD\cdot DC}=\frac{PB^2}{PD^2}. \]

Mike has $1000$ unit cubes. Each has $2$ opposite red faces, $2$ opposite blue faces and $2$ opposite white faces. Mike assembles them into a $10 \times 10 \times 10$ cube. Whenever two unit cubes meet face to face, these two faces have the same colour. Prove that an entire face of the $10 \times 10 \times 10$ cube has the same colour. [i](6 points)[/i]

In a triangle ABC with circumcentre O and centroid M, lines OM and AM are perpendicular. Let AM intersect the circumcircle of ABC again at A′. Let lines BA′ and AC intersect at D and let lines CA′ and AB intersect at E. Prove that the circumcentre of triangle ADE lies on the circumcircle of ABC.

Let $ABC$ be a triangle inscribed in a circle with center $O$. Let $A_1$ be a point on arc $BC$ that does not contain $ A$ such that the line perpendicular to $OA$ at $A_1$ intersects the lines $AB$ and $AC$ at two points and the line segment joining those two points has as midpoint $A_1$. Points $B_1$, $C_1$ are determined similarly. Prove that the lines $AA_1$, $BB_1$, $CC_1$ are concurrent.

If $f(x)=\log \left(\frac{1+x}{1-x}\right)$ for $-1<x<1$, then $f\left(\frac{3x+x^3}{1+3x^2}\right)$ in terms of $f(x)$ is $\textbf{(A) }-f(x)\qquad\textbf{(B) }2f(x)\qquad\textbf{(C) }3f(x)\qquad$ $\textbf{(D) }\left[f(x)\right]^2\qquad \textbf{(E) }[f(x)]^3-f(x)$

In triangle $ABC$ lines $CE$ and $AD$ are drawn so that $\dfrac{CD}{DB}=\dfrac{3}{1}$ and $\dfrac{AE}{EB}=\dfrac{3}{2}$. Let $r=\dfrac{CP}{PE}$ where $P$ is the intersection point of $CE$ and $AD$. Then $r$ equals: [asy] size(8cm); pair A = (0, 0), B = (9, 0), C = (3, 6); pair D = (7.5, 1.5), E = (6.5, 0); pair P = intersectionpoints(A--D, C--E)[0]; draw(A--B--C--cycle); draw(A--D); draw(C--E); label("$A$", A, SW); label("$B$", B, SE); label("$C$", C, N); label("$D$", D, NE); label("$E$", E, S); label("$P$", P, S); //Credit to MSTang for the asymptote [/asy] $\textbf{(A)}\ 3 \qquad \textbf{(B)}\ \dfrac{3}{2}\qquad \textbf{(C)}\ 4 \qquad \textbf{(D)}\ 5 \qquad \textbf{(E)}\ \dfrac{5}{2}$

Evaluate $ \int_0^{\frac{\pi}{6}} \frac{\sqrt{1\plus{}\sin x}}{\cos x}\ dx$.

How many subsets of $\{1,2,3,4,\dots,12\}$ contain exactly one prime number?

The Fibonacci sequence is given by equalities $$F_1=F_2=1, F_{k+2}=F_k+F_{k+1}, k\in N$$. a) Prove that for every $m \ge 0$, the area of ​​the triangle $A_1A_2A_3$ with vertices $A_1(F_{m+1},F_{m+2})$, $A_2 (F_{m+3},F_{m+4})$, $A_3 (F_{m+5},F_{m+6})$ is equal to $0.5$. b) Prove that for every $m \ge 0$ the quadrangle $A_1A_2A_4$ with vertices $A_1(F_{m+1},F_{m+2})$, $A_2 (F_{m+3},F_{m+4})$, $A_3 (F_{m+5},F_{m+6})$, $A_4 (F_{m+7},F_{m+8})$ is a trapezoid, whose area is equal to $2.5$. c) Prove that the area of ​​the polygon $A_1A_2...A_n$ , $n \ge3$ with vertices does not depend on the choice of numbers $m \ge 0$, and find this area.

The number $123$ is shown on the screen of a computer. Each minute the computer adds $102$ to the number on the screen. The computer expert Misha may change the order of digits in the number on the screen whenever he wishes. Can he ensure that no four-digit number ever appears on the screen? (F.L. Nazarov, Leningrad)

Show that there exists a positive integer $N$ such that the decimal representation of $2000^N$ starts with the digits $200120012001.$

Baron Munсhausen discovered the following theorem: "For any positive integers $a$ and $b$ there exists a positive integer $n$ such that $an$ is a perfect cube, while $bn$ is a perfect fifth power". Determine if the statement of Baron’s theorem is correct.

[color=darkred]Let $A\, ,\, B\in\mathcal{M}_2(\mathbb{C})$ so that : $A^2+B^2=2AB$ . [b]a)[/b] Prove that : $AB=BA$ . [b]b)[/b] Prove that : $\text{tr}\, (A)=\text{tr}\, (B)$ .[/color]

Find all pairs $(m, n)$ of positive integers for which $4 (mn +1)$ is divisible by $(m + n)^2$.

Prove that for every natural number $n$, and for every real number $x \neq \frac{k\pi}{2^t}$ ($t=0,1, \dots, n$; $k$ any integer) \[ \frac{1}{\sin{2x}}+\frac{1}{\sin{4x}}+\dots+\frac{1}{\sin{2^nx}}=\cot{x}-\cot{2^nx} \]

For an integer $n\ge 2$ find all $a_1,a_2,\cdots ,a_n, b_1,b_2,\cdots , b_n$ so that (a) $0\le a_1\le a_2\le \cdots \le a_n\le 1\le b_1\le b_2\le \cdots \le b_n;$ (b) $\sum_{k=1}^n (a_k+b_k)=2n;$ (c) $\sum_{k=1}^n (a_k^2+b_k^2)=n^2+3n.$

Four mathletes and two coaches sit at a circular table. How many distinct arrangements are there of these six people if the two coaches sit opposite each other?

Prove that for all real numbers $a, b, c > 1$ the inequality \[a(b^2 + c) + b(c^2 + a) + c(a^2 + b) \ge a^2 + b^2 + c^2 + 3abc\] holds. When does equality hold? Proposed by [i]Ilija Jovcevski[/i]