Two are playing the game "cats and rats" on the chess-board $8\times 8$. The first has one piece -- a rat, the second -- several pieces -- cats. All the pieces have four available moves -- up, down, left, right -- to the neighbour field, but the rat can also escape from the board if it is on the boarder of the chess-board. If they appear on the same field -- the rat is eaten. The players move in turn, but the second can move all the cats in independent directions. a) Let there be two cats. The rat is on the interior field. Is it possible to put the cats on such a fields on the border that they will be able to catch the rat? b) Let there be three cats, but the rat moves twice during the first turn. Prove that the rat can escape.

There are 10 numbers on a board. The product of any four of them is divisible by 30. Prove that at least one of the numbers on the board is divisible by 30.

Denote by $d(n)$ the number of divisors of the positive integer $n$. A positive integer $n$ is called highly divisible if $d(n) > d(m)$ for all positive integers $m < n$. Two highly divisible integers $m$ and $n$ with $m < n$ are called consecutive if there exists no highly divisible integer $s$ satisfying $m < s < n$. (a) Show that there are only finitely many pairs of consecutive highly divisible integers of the form $(a, b)$ with $a\mid b$. (b) Show that for every prime number $p$ there exist infinitely many positive highly divisible integers $r$ such that $pr$ is also highly divisible.

[list] [*]There are two semi-infinite plane mirrors inclined physically at a non-zero angle with the inner surfaces being reflective.\\ Prove that all lines of incident/reflected rays are tangential to a particular circle for any given incident ray being incident on a reflective side. Assume that the incident ray lies on one of the normal planes to the mirrors.[/*] [*] There's a cone of an arbitrary base with large enough length.\\ The inner surface polished (Outer surface is absorbing in nature) and the apex is fixed to a point. The cone is being rotated around the apex at an angular speed $\omega$ around the vertical axis and assume that a large part of the inside is visible horizontally. A fixed horizontal ray is projected from outside towards the cone (which often falls inside of it), prove that all the lines of incident ray/reflected rays at all instants lie tangential to a particular sphere.\\ Try guessing the radius of the sphere with the parameters you observe.[/*]

In each lattice-point of an $m \times n$ grid and in the centre of each of the formed unit squares a pawn is placed. a) Find all such grids with exactly $500$ pawns. b) Prove that there are infinitely many positive integers $k$ for which therer is no grid containing exactly $k$ pawns.

Given is an obtuse isosceles triangle $ABC$ with $CA=CB$ and circumcenter $O$. The point $P$ on $AB$ is such that $AP<\frac{AB} {2}$ and $Q$ on $AB$ is such that $BQ=AP$. The circle with diameter $CQ$ meets $(ABC)$ at $E$ and the lines $CE, AB$ meet at $F$. If $N$ is the midpoint of $CP$ and $ON, AB$ meet at $D$, show that $ODCF$ is cyclic.

Given a triangle $ ABC $, $ AD $ is its angle bisector. Let $ E, F $ be the centers of the circles inscribed in the triangles $ ADC $ and $ ADB $, respectively. Denote by $ \omega $, the circle circumscribed around the triangle $ DEF $, and by $ Q $, the intersection point of $ BE $ and $ CF $, and $ H, J, K, M $ , respectively the second intersection point of the lines $ CE, CF, BE, BF $ with circle $ \omega $. Let $\omega_1, \omega_2 $ the circles be circumscribed around the triangles $ HQJ $ and $ KQM $ Prove that the intersection point of the circles $\omega_1, \omega_2 $ different from $ Q $ lies on the line $ AD $. (Kivva Bogdan)

The $ABC$ triangle is given, point $I_a$ is the center of an exscribed circle touching the side $BC$ , the point $M$ is the midpoint of the side $BC$, the point $W$ is the intersection point of the bisector of the angle $A$ of the triangle $ABC$ with the circumscribed circle around him. Prove that the area of the triangle $I_aBC$ is calculated by the formula $S_{ (I_aBC)} = MW \cdot p$, where $p$ is the semiperimeter of the triangle $ABC$. (Mykola Moroz)

Let $\leftarrow$ denote the left arrow key on a standard keyboard. If one opens a text editor and types the keys "ab$\leftarrow$ cd $\leftarrow \leftarrow$ e $\leftarrow \leftarrow$ f", the result is "faecdb". We say that a string $B$ is [i]reachable[/i] from a string $A$ if it is possible to insert some amount of $\leftarrow$'s in $A$, such that typing the resulting characters produces $B$. So, our example shows that "faecdb" is reachable from "abcdef". Prove that for any two strings $A$ and $B$, $A$ is reachable from $B$ if and only if $B$ is reachable from $A$.

Let $P(x)$ be a polynomial of degree $10$ with non-negative integer coefficients. The remainder when $P(x)$ is divided by $(x - 1)$ is $3$. How many such polynomials are there ?

Quadrilateral $ABCD$ is inscribed into circle $\omega$, $AC$ intersect $BD$ in point $K$. Points $M_1$, $M_2$, $M_3$, $M_4$-midpoints of arcs $AB$, $BC$, $CD$, and $DA$ respectively. Points $I_1$, $I_2$, $I_3$, $I_4$-incenters of triangles $ABK$, $BCK$, $CDK$, and $DAK$ respectively. Prove that lines $M_1I_1$, $M_2I_2$, $M_3I_3$, and $M_4I_4$ all intersect in one point.

[b]Problem Section #4 a) There is a $6 * 6$ grid, each square filled with a grasshopper. After the bell rings, each grasshopper jumps to an adjacent square (A square that shares a side). What is the maximum number of empty squares possible?

[5] If four fair six-sided dice are rolled, what is the probability that the lowest number appearing on any die is exactly $3$?

Suppose that $p$ is a prime number and is greater than $3$. Prove that $7^{p}-6^{p}-1$ is divisible by $43$.

In the equation $ \frac {x(x \minus{} 1) \minus{} (m \plus{} 1)}{(x \minus{} 1)(m \minus{} 1)} \equal{} \frac {x}{m}$ the roots are equal when $ \textbf{(A)}\ m \equal{} 1 \qquad\textbf{(B)}\ m \equal{} \frac {1}{2} \qquad\textbf{(C)}\ m \equal{} 0 \qquad\textbf{(D)}\ m \equal{} \minus{} 1 \qquad\textbf{(E)}\ m \equal{} \minus{} \frac {1}{2}$

Determine all triples $(x, y, z)$ of nonnegative real numbers that verify the following system of equations: $$x^2 - y = (z -1)^2 $$ $$y^2 - z = (x -1)^2$$ $$z^2 - x = (y - 1)^2$$

Prove that the product of the sides of a quadrilateral inscribed in a circle with radius $1$ does not exceed $4$.

A network is a simple directed graph such that each edge $ e$ has two intger lower and upper capacities $ 0\leq c_l(e)\leq c_u(e)$. A circular flow on this graph is a function such that: 1) For each edge $ e$, $ c_l(e)\leq f(e)\leq c_u(e)$. 2) For each vertex $ v$: \[ \sum_{e\in v^\plus{}}f(e)\equal{}\sum_{e\in v^\minus{}}f(e)\] a) Prove that this graph has a circular flow, if and only if for each partition $ X,Y$ of vertices of the network we have: \[ \sum_{\begin{array}{c}{e\equal{}xy}\\{x\in X,y\in Y}\end{array}} c_l(e)\leq \sum_{\begin{array}{c}{e\equal{}yx}\\{y\in Y,x\in X}\end{array}} c_l(e)\] b) Suppose that $ f$ is a circular flow in this network. Prove that there exists a circular flow $ g$ in this network such that $ g(e)\equal{}\lfloor f(e)\rfloor$ or $ g(e)\equal{}\lceil f(e)\rceil$ for each edge $ e$.

Let $n$ be a natural number, for which we define $S(n)=\{1+g+g^2+...+g^{n-1}|g\in{\mathbb{N}},g\geq2\}$ $a)$ Prove that: $S(3)\cap S(4)=\varnothing$ $b)$ Determine: $S(3)\cap S(5)$

If for the real numbers $x, y,z, k$ the following conditions are valid, $x \ne y \ne z \ne x$ and $x^3 +y^3 +k(x^2 +y^2) = y^3 +z^3 +k(y^2 +z^2) = z^3 +x^3 +k(z^2 +x^2) = 2008$, find the product $xyz$.

Let $ABC$ be a triangle and $AD$ be the bisector of the triangle ($D \in (BC)$) Assume that $AB =14$ cm, $AC = 35$ cm and $AD = 12$ cm; which of the following is the area of triangle $ABC$ in cm$^2$? [b]A.[/b] $\frac{1176}{5}$ [b]B.[/b] $\frac{1167}{5}$ [b]C.[/b] $234$ [b]D.[/b] $\frac{1176}{7}$ [b]E.[/b] $236$

What is $ 100(100\minus{}3) \minus{} (100 \cdot 100 \minus{} 3)$? $ \textbf{(A)}\ \minus{}20,000 \qquad \textbf{(B)}\ \minus{}10,000 \qquad \textbf{(C)}\ \minus{}297 \qquad \textbf{(D)}\ \minus{}6 \qquad \textbf{(E)}\ 0$

There are several contestants at a math olympiad. We say that two contestants $ A$ and $ B$ are [i]indirect friends[/i] if there are contestants $ C_1, C_2, ..., C_n$ such that $ A$ and $ C_1$ are friends, $ C_1$ and $ C_2$ are friends, $ C_2$ and $ C_3$ are friends, ..., $ C_n$ and $ B$ are friends. In particular, if $ A$ and $ B$ are friends themselves, they are [i]indirect friends[/i] as well. Some of the contestants were friends before the olympiad. During the olympiad, some contestants make new friends, so that after the olympiad every contestant has at least one friend among the other contestants. We say that a contestant is [i]special[/i] if, after the olympiad, he has exactly twice as indirect friends as he had before the olympiad. Prove that the number of special contestants is less or equal than $ \frac{2}{3}$ of the total number of contestants.

Find all all positive integers x,y,and z satisfying the equation $x^3=3^y7^z+8$

Eight politicians stranded on a desert island on January 1st, 1991, decided to establish a parliament. They decided on the following rules of attendance: (a) There should always be at least one person present on each day. (b) On no two days should the same subset attend. (c) The members present on day $N$ should include for each $K<N$, $(K\ge 1)$ at least one member who was present on day $K$. For how many days can the parliament sit before one of the rules is broken?