$ 101$ positive integers are written on a line. Prove that we can write signs $ \plus{}$, signs $ \times$ and parenthesis between them, without changing the order of the numbers, in such a way that the resulting expression makes sense and the result is divisible by $ 16!$.

Here $G_{n}$ denotes a simple undirected graph with $n$ vertices, $K_{n}$ denotes the complete graph with $n$ vertices, $K_{n,m}$ the complete bipartite graph whose components have $m$ and $n$ vertices, and $C_{n}$ a circuit with $n$ vertices. The number of edges in the graph $G_{n}$ is denoted $e(G_{n})$. (a) Let $p$ be a prime. Consider the graph whose vertices are the ordered pairs $(x, y)$ with $x, y \in\{0, 1, . . . , p-1\}$ and whose edges join vertices $(x, y)$ and $(x' , y')$ if and only if $xx'+yy'\equiv 1 \pmod{p}$ . Prove that this graph does not contain $C_{4}$ . (b) Prove that for infinitely many values $n$ there is a graph $G_{n}$ with $e(G_{n}) \geq \frac{n\sqrt{n}}{2}-n$ that does not contain $C_{4}$.

Suppose that $k$ is a natural number. Prove that there exists a prime number in $\mathbb Z_{[i]}$ such that every other prime number in $\mathbb Z_{[i]}$ has a distance at least $k$ with it.

An infinite arithmetic progression whose terms are positive integers contains the square of an integer and the cube of an integer. Show that it contains the sixth power of an integer.

The positive integers $ a$ and $ b$ are such that the numbers $ 15a \plus{} 16b$ and $ 16a \minus{} 15b$ are both squares of positive integers. What is the least possible value that can be taken on by the smaller of these two squares?

What is the smallest positive integer $n$ such that $2013^n$ ends in $001$ (i.e. the rightmost three digits of $2013^n$ are $001$?

Determine all integers $ n > 1$ such that \[ \frac {2^n \plus{} 1}{n^2} \] is an integer.

Prove that there exist infinitely many pairs $ (a, b)$ of natural numbers not equal to $ 1$ such that $ b^b \plus{}a$ is divisible by $ a^a \plus{}b$.

What is $3^{2002}$ in $\bmod 11$? $ \textbf{a)}\ 1 \qquad\textbf{b)}\ 3 \qquad\textbf{c)}\ 4 \qquad\textbf{d)}\ 5 \qquad\textbf{e)}\ \text{None of above} $

Prove that $ 7^{2^{20}} + 7^{2^{19}} + 1 $ has at least $ 21 $ distinct prime divisors.

Find all pairs of two positive integers $(m,n)$ satisfying $ 3^m - 7^n = 2 $.

How many integers $0\leq x < 121$ are there such that $x^5+5x^2 + x + 1 \equiv 0 \pmod{121}$? $ \textbf{(A)}\ 0 \qquad\textbf{(B)}\ 1 \qquad\textbf{(C)}\ 2 \qquad\textbf{(D)}\ 4 \qquad\textbf{(E)}\ 5 $

Let $n$ be a positive integer. Find, with proof, the least positive integer $d_{n}$ which cannot be expressed in the form \[\sum_{i=1}^{n}(-1)^{a_{i}}2^{b_{i}},\] where $a_{i}$ and $b_{i}$ are nonnegative integers for each $i.$

Show that \[\cos(56^{\circ}) \cdot \cos(2 \cdot 56^{\circ}) \cdot \cos(2^2\cdot 56^{\circ})\cdot . . . \cdot \cos(2^{23}\cdot 56^{\circ}) = \frac{1}{2^{24}} .\]

Let $n$ be a non-negative integer. Find all non-negative integers $a,b,c,d$ such that \[a^2+b^2+c^2+d^2=7\cdot 4^n\]

Given an integer $n\ge 2$, a function $f:\mathbb{Z}\rightarrow \{1,2,\ldots,n\}$ is called [i]good[/i], if for any integer $k,1\le k\le n-1$ there exists an integer $j(k)$ such that for every integer $m$ we have \[f(m+j(k))\equiv f(m+k)-f(m) \pmod{n+1}. \] Find the number of [i]good[/i] functions.

How many positive integer cubes divide $ 3!\cdot 5!\cdot 7!$? $ \textbf{(A)}\ 2\qquad \textbf{(B)}\ 3\qquad \textbf{(C)}\ 4\qquad \textbf{(D)}\ 5\qquad \textbf{(E)}\ 6$

Determine all integers $n \ge 2$ such that $n \mid s_n-t_n$ where $s_n$ is the sum of all the integers in the interval $[1,n]$ that are mutually prime to $n$, and $t_n$ is the sum of the remaining integers in the same interval.

Prove that any irreducible fraction $p/q$, where $p$ and $q$ are positive integers and $q$ is odd, is equal to a fraction $\frac{n}{2^k-1}$ for some positive integers $n$ and $k$.

Let $ n$ be a natural number $ \ge 2$ which divides $ 3^n\plus{}4^n$.Prove That $ 7\mid n$.

Determine all positive integers $n$ for which there exists a polynomial $f(x)$ with real coefficients, with the following properties: (1) for each integer $k$, the number $f(k)$ is an integer if and only if $k$ is not divisible by $n$; (2) the degree of $f$ is less than $n$. [i](Hungary) Géza Kós[/i]

Let $p$ be an odd prime and $a_1, a_2,...,a_p$ be integers. Prove that the following two conditions are equivalent: 1) There exists a polynomial $P(x)$ with degree $\leq \frac{p-1}{2}$ such that $P(i) \equiv a_i \pmod p$ for all $1 \leq i \leq p$ 2) For any natural $d \leq \frac{p-1}{2}$, $$ \sum_{i=1}^p (a_{i+d} - a_i )^2 \equiv 0 \pmod p$$ where indices are taken $\pmod p$

Show that there exists a positive integer $ k$ such that $ k \cdot 2^{n} \plus{} 1$ is composite for all $ n \in \mathbb{N}_{0}$.

Show that the numerator of \[ \frac{2^{p-1}}{p+1} - \left(\sum_{k = 0}^{p-1}\frac{\binom{p-1}{k}}{(1-kp)^2}\right) \] is a multiple of $p^3$ for any odd prime $p$. [i]Proposed by Yang Liu[/i]

Let $P$ and $Q$ be two horizontal neighbouring squares on a $n \times n$ chess board, $P$ on the left and $Q$ on the right. On the left square $P$ there is a stone that shall be moved around the board. The following moves are allowed: 1) move it one square upwards 2) move it one square to the right 3) move it one square down and one square to the left (diagonal movement) Example: you can get from $e5$ to $f5$, $e6$ and $d4$. Show that for no $n$ there is tour visting every square exactly once and ending in $Q$.