A nonnegative real number is written at every cube's vertex. The sum of those numbers equals to $1$. Two players choose in turn faces of the cube, but they cannot choose the face parallel to already chosen one (the first moves twice, the second -- once). Prove that the first player can provide the number, at the common for three chosen faces vertex, to be not greater than $1/6$.

Find the smallest positive integer $n$ such that \[2^{1989}\; \vert \; m^{n}-1\] for all odd positive integers $m>1$.

During a break, $n$ children at school sit in a circle around their teacher to play a game. The teacher walks clockwise close to the children and hands out candies to some of them according to the following rule. He selects one child and gives him a candy, then he skips the next child and gives a candy to the next one, then he skips 2 and gives a candy to the next one, then he skips 3, and so on. Determine the values of $n$ for which eventually, perhaps after many rounds, all children will have at least one candy each.

Suppose $S$ is a convex figure in plane with area $10$. Consider a chord of length $3$ in $S$ and let $A$ and $B$ be two points on this chord which divide it into three equal parts. For a variable point $X$ in $S-\{A,B\}$, let $A'$ and $B'$ be the intersection points of rays $AX$ and $BX$ with the boundary of $S$. Let $S'$ be those points $X$ for which $AA'>\frac{1}{3} BB'$. Prove that the area of $S'$ is at least $6$. [i]Proposed by Ali Khezeli[/i]

Let $m$ and $n$ are fixed natural numbers and $Oxy$ is a coordinate system in the plane. Find the total count of all possible situations of $n+m-1$ points $P_1(x_1,y_1),P_2(x_2,y_2),\ldots,P_{n+m-1}(x_{n+m-1},y_{n+m-1})$ in the plane for which the following conditions are satisfied: (i) The numbers $x_i$ and $y_i~(i=1,2,\ldots,n+m-1)$ are integers and $1\le x_i\le n,1\le y_i\le m$. (ii) Every one of the numbers $1,2,\ldots,n$ can be found in the sequence $x_1,x_2,\ldots,x_{n+m-1}$ and every one of the numbers $1,2,\ldots,m$ can be found in the sequence $y_1,y_2,\ldots,y_{n+m-1}$. (iii) For every $i=1,2,\ldots,n+m-2$ the line $P_iP_{i+1}$ is parallel to one of the coordinate axes. [i](Ivan Gochev, Hristo Minchev)[/i]

Consider the circle $\Omega$ with radius $9$ and center at the origin $(0,\,0)$, and a disk $\Delta$ with radius $1$ and center at $(r,\,0)$, where $0\leq r\leq 8$. Two points $P$ and $Q$ are chosen independently and uniformly at random on $\Omega$. Which value(s) of $r$ minimize the probability that the chord $\overline{PQ}$ intersects $\Delta$?

As a reward for working for NIMO, Evan divides $100$ indivisible marbles among three of his volunteers: David, Justin, and Michael. (Of course, each volunteer must get at least one marble!) However, Evan knows that, in the middle of the night, Lewis will select a positive integer $n > 1$ and, for each volunteer, steal exactly $\frac 1n$ of his marbles (if possible, i.e. if $n$ divides the number of marbles). In how many ways can Evan distribute the $100$ marbles so that Lewis is unable to steal marbles from every volunteer, regardless of which $n$ he selects? [i]Proposed by Jack Cornish[/i]

Find all tuples $ (x_1,x_2,x_3,x_4,x_5)$ of positive integers with $ x_1>x_2>x_3>x_4>x_5>0$ and $ {\left \lfloor \frac{x_1+x_2}{3} \right \rfloor }^2 + {\left \lfloor \frac{x_2+x_3}{3} \right \rfloor }^2 + {\left \lfloor \frac{x_3+x_4}{3} \right \rfloor }^2 + {\left \lfloor \frac{x_4+x_5}{3} \right \rfloor }^2 = 38.$

The natural numbers $t{}$ and $q{}$ are given. For an integer $s{}$, we denote by $f(s)$ the number of lattice points lying in the triangle with vertices $(0;-t/q), (0; t/q)$ and $(t; ts/q)$. Suppose that $q{}$ divides $rs-1{}$. Prove that $f(r) = f(s)$.

A segment of unit length is cut into eleven smaller segments, each with length of no more than $a$. For what values of $a$, can one guarantee that any three segments form a triangle? [i](4 points)[/i]

The sum of $n > 2$ nonzero real numbers (not necessarily distinct) equals zero. For each of the $2^n - 1$ ways to choose one or more of these numbers, their sums are written in non-increasing order in a row. The first number in the row is $S$. Find the smallest possible value of the second number.

Define the functions $g_k \colon \mathbb{Z} \to \mathbb{Z}$, $g_k(x) = x^k$, where $k$ is a positive integer. Find the set $M_k$ of positive integers $n$ for which there exist injective functions $f_1,f_2, \dots ,f_n \colon \mathbb{Z} \to \mathbb{Z}$ such that $g_k=f_1\cdot f_2 \cdot \ldots \cdot f_n$. (Here, $\cdot$ denotes component-wise function multiplication)

There are $20$ points marked on a circle. Two players take turns drawing chords with ends at marked points that do not intersect the already drawn chords. The one who cannot make the next move loses. Who can secure their win?

$M$ is midpoint of $BC$.$P$ is an arbitary point on $BC$. $C_{1}$ is tangent to big circle.Suppose radius of $C_{1}$ is $r_{1}$ Radius of $C_{4}$ is equal to radius of $C_{1}$ and $C_{4}$ is tangent to $BC$ at P. $C_{2}$ and $C_{3}$ are tangent to big circle and line $BC$ and circle $C_{4}$. [img]http://aycu01.webshots.com/image/4120/2005120338156776027_rs.jpg[/img] Prove : \[r_{1}+r_{2}+r_{3}=R\] ($R$ radius of big circle)

$(GDR 3)$ Find the number of permutations $a_1, \cdots, a_n$ of the set $\{1, 2, . . ., n\}$ such that $|a_i - a_{i+1}| \neq 1$ for all $i = 1, 2, . . ., n - 1.$ Find a recurrence formula and evaluate the number of such permutations for $n \le 6.$

Find all non-negative integers $m,n,p,q$ such that \[ p^mq^n = (p+q)^2 +1 . \]

Let $n$ be an integer greater than $2$ and consider the set \begin{align*} A = \{2^n-1,3^n-1,\dots,(n-1)^n-1\}. \end{align*} Given that $n$ does not divide any element of $A$, prove that $n$ is a square-free number. Does it necessarily follow that $n$ is a prime?

The number of four-digit odd numbers having digits $1,2,3,4$, each occuring exactly once, is:

A [i]lame king[/i] is a chess piece that can move from a cell to any cell that shares at least one vertex with it, except for the cells in the same column as the current cell. A lame king is placed in the top-left cell of a $7\times 7$ grid. Compute the maximum number of cells it can visit without visiting the same cell twice (including its starting cell).

We are given an acute triangle $ABC$ with $AB\neq AC$. Let $D$ be a point of $BC$ such that $DA$ is tangent to the circumcircle of $ABC$. Let $E$ and $F$ be the circumcenters of triangles $ABD$ and $ACD$, respectively, and let $M$ be the midpoints $EF$. Prove that the line tangent to the circumcircle of $AMD$ through $D$ is also tangent to the circumcircle of $ABC$. [i]Proposed by Patrik Bak, Slovakia[/i]

On a horizontal line, $2005$ points are marked, each of which is either white or black. For every point, one finds the sum of the number of white points on the right of it and the number of black points on the left of it. Among the $2005$ sums, exactly one number occurs an odd number of times. Find all possible values of this number.

What is the maximum displacement from start for the toy car? (a) $\text{3 m}$ (b) $\text{5 m}$ (c) $\text{6.5 m}$ (d) $\text{7 m}$ (e) $\text{7.5 m}$

For every $n$ in the set $\mathrm{N} = \{1,2,\dots \}$ of positive integers, let $r_n$ be the minimum value of $|c-d\sqrt{3}|$ for all nonnegative integers $c$ and $d$ with $c+d=n$. Find, with proof, the smallest positive real number $g$ with $r_n \leq g$ for all $n \in \mathbb{N}$.

Given 11 natural numbers under 21, show that you can choose two such that one divides the other.

Find all functions $f: N_0 \to N_0$, (where $N_0$ is the set of all non-negative integers) such that $f(f(n))=f(n)+1$ for all $n \in N_0$ and the minimum of the set $\{ f(0), f(1), f(2) \cdots \}$ is $1$.