Suppose that $m=nq$, where $n$ and $q$ are positive integers. Prove that the sum of binomial coefficients \[\sum_{k=0}^{n-1}{ \gcd(n, k)q \choose \gcd(n, k)}\] is divisible by $m$.

The sequence $ (F_n)$ of Fibonacci numbers satisfies $ F_1 \equal{} 1, F_2 \equal{} 1$ and $ F_n \equal{} F_{n\minus{}1} \plus{}F_{n\minus{}2}$ for all $ n \ge 3$. Find all pairs of positive integers $ (m, n)$, such that $ F_m . F_n \equal{} mn$.

An $m\times n$ checkerboard is colored randomly: each square is independently assigned red or black with probability $\frac12.$ we say that two squares, $p$ and $q$, are in the same connected monochromatic region if there is a sequence of squares, all of the same color, starting at $p$ and ending at $q,$ in which successive squares in the sequence share a common side. Show that the expected number of connected monochromatic regions is greater than $\frac{mn}8.$

For each positive integer $ k$, find the smallest number $ n_{k}$ for which there exist real $ n_{k}\times n_{k}$ matrices $ A_{1}, A_{2}, \ldots, A_{k}$ such that all of the following conditions hold: (1) $ A_{1}^{2}= A_{2}^{2}= \ldots = A_{k}^{2}= 0$, (2) $ A_{i}A_{j}= A_{j}A_{i}$ for all $ 1 \le i, j \le k$, and (3) $ A_{1}A_{2}\ldots A_{k}\ne 0$.

Let $ a_1, a_2,\ldots, a_n$ be non-negative real numbers. Prove that $\frac{1}{1+ a_1}+\frac{ a_1}{(1+ a_1)(1+ a_2)}+\frac{ a_1 a_2}{(1+ a_1)(1+ a_2)(1+ a_3)}+$ $\cdots+\frac{ a_1 a_2\cdots a_{n-1}}{(1+ a_1)(1+ a_2)\cdots (1+ a_n)} \le 1.$

Show that for each $n \ge 2$, there is a set $S$ of $n$ integers such that $(a-b)^2$ divides $ab$ for every distinct $a, b\in S$.

Define a [i]beautiful number[/i] to be an integer of the form $a^n$, where $a\in\{3,4,5,6\}$ and $n$ is a positive integer. Prove that each integer greater than $2$ can be expressed as the sum of pairwise distinct beautiful numbers. [i]Proposed by Matthew Babbitt[/i]

Let $b$ and $c$ be any two positive integers. Define an integer sequence $a_n$, for $n\geq 1$, by $a_1=1$, $a_2=1$, $a_3=b$ and $a_{n+3}=ba_{n+2}a_{n+1}+ca_n$. Find all positive integers $r$ for which there exists a positive integer $n$ such that the number $a_n$ is divisible by $r$.

A prime number $p$ is a [b]moderate[/b] number if for every $2$ positive integers $k > 1$ and $m$, there exists k positive integers $n_1, n_2, ..., n_k $ such that \[ n_1^2+n_2^2+ ... +n_k^2=p^{k+m} \] If $q$ is the smallest [b]moderate[/b] number, then determine the smallest prime $r$ which is not moderate and $q < r$.

Prove that for each $ n$: \[ \sum_{k\equal{}1}^n\binom{n\plus{}k\minus{}1}{2k\minus{}1}\equal{}F_{2n}\]

A crazy physicist discovered a new kind of particle wich he called an imon, after some of them mysteriously appeared in his lab. Some pairs of imons in the lab can be entangled, and each imon can participate in many entanglement relations. The physicist has found a way to perform the following two kinds of operations with these particles, one operation at a time. (i) If some imon is entangled with an odd number of other imons in the lab, then the physicist can destroy it. (ii) At any moment, he may double the whole family of imons in the lab by creating a copy $I'$ of each imon $I$. During this procedure, the two copies $I'$ and $J'$ become entangled if and only if the original imons $I$ and $J$ are entangled, and each copy $I'$ becomes entangled with its original imon $I$; no other entanglements occur or disappear at this moment. Prove that the physicist may apply a sequence of such operations resulting in a family of imons, no two of which are entangled.

Show that for all positive integer $n$ the following inequality holds $3^{n^2} > (n!)^4$ .

Find the least $n\in N$ such that among any $n$ rays in space sharing a common origin there exist two which form an acute angle.

Define $L(x) = x - \frac{x^2}{2}$ for every real number $x$. If $n$ is a positive integer, define $a_n$ by \[ a_n = L \Bigl( L \Bigl( L \Bigl( \cdots L \Bigl( \frac{17}{n} \Bigr) \cdots \Bigr) \Bigr) \Bigr), \] where there are $n$ iterations of $L$. For example, \[ a_4 = L \Bigl( L \Bigl( L \Bigl( L \Bigl( \frac{17}{4} \Bigr) \Bigr) \Bigr) \Bigr). \] As $n$ approaches infinity, what value does $n a_n$ approach?