Find all surjective functions $ f: \mathbb{N} \to \mathbb{N}$ such that for every $ m,n \in \mathbb{N}$ and every prime $ p,$ the number $ f(m + n)$ is divisible by $ p$ if and only if $ f(m) + f(n)$ is divisible by $ p$. [i]Author: Mohsen Jamaali and Nima Ahmadi Pour Anari, Iran[/i]

Let $ m$ and $ n$ be positive integers. Prove that $ 6m | (2m \plus{} 3)^n \plus{} 1$ if and only if $ 4m | 3^n \plus{} 1$

Prove that there are infinitely many positive integers that cannot be expressed as the sum of a triangular number and a prime number.

Prove that a binomial coefficient $\binom nk$ is odd if and only if all digits $1$ of $k$, when $k$ is written in binary, are on the same positions when $n$ is written in binary. [i]I. Dimovski[/i]

For each positive integer $k$ find the number of solutions in nonnegative integers $x,y,z$ with $x\le y \le z$ of the equation $$8^k=x^3+y^3+z^3-3xyz$$

Prove that for any integers $ n> m> 0 $ the number $ 2 ^n-1 $ has a prime divisor not dividing $ 2 ^m-1 $.

Prove that there exists no innite sequence of prime numbers $p_0, p_1, p_2,...$ such that for all positive integers $k$: $p_k = 2p_{k-1} + 1$ or $p_k = 2p_{k-1} - 1$.

Show that, if $\sqrt{2}$ is written in decimal notation, there is at least one nonzero digit at the interval of 1,000,000-th and 3,000,000-th digits.

Find all triples $(a, b, n)$ of positive integers such that $a$ and $b$ are both divisors of $n$, and $a+b = \frac{n}{2}$ .

Suppose that we have a set $S$ of $756$ arbitrary integers between $1$ and $2008$ ($1$ and $2008$ included). Prove that there are two distinct integers $a$ and $b$ in $S$ such that their sum $a + b$ is divisible by $8$.

The digits $1,2,3,..., 9$ are written down in some order so that they form a $9$-digit number. Consider all triples of consecutive digits and find the sum of these seven $3$-digit numbers. What is the largest possible value of this sum? (A Galochkin)

Find all triples $(a,b,c)$ of positive integers such that if $n$ is not divisible by any prime less than $2014$, then $n+c$ divides $a^n+b^n+n$. [i]Proposed by Evan Chen[/i]

Determine all nonzero natural numbers $n$, for which the number $\sqrt{n! + 5}$ is a natural number.

There three piles of pebbles, containing 5, 49, and 51 pebbles respectively. It is allowed to combine any two piles into a new one or to split any pile consisting of even number of pebbles into two equal piles. Is it possible to have 105 piles with one pebble in each in the end? [i](3 points)[/i]

Let $a_1,a_2,...,a_{11}$ be integers. Prove that there are numbers $b_1,b_2,...,b_{11}$, each $b_i$ equal $-1,0$ or $1$, but not all being $0$, such that the number $$N=a_1b_1+a_2b_2+...+a_{11}b_{11}$$ is divisible by $2015$.

An integer $a$ is called friendly if the equation $(m^2+n)(n^2+m)=a(m-n)^3$ has a solution over the positive integers. [b]a)[/b] Prove that there are at least $500$ friendly integers in the set $\{ 1,2,\ldots ,2012\}$. [b]b)[/b] Decide whether $a=2$ is friendly.

Does there exist a a sequence $a_{0},a_{1},a_{2},\dots$ in $\mathbb N$, such that for each $i\neq j, (a_{i},a_{j})=1$, and for each $n$, the polynomial $\sum_{i=0}^{n}a_{i}x^{i}$ is irreducible in $\mathbb Z[x]$? [i]By Omid Hatami[/i]

Two players $A$ and $B$ play the following game. Before the game starts, $A$ chooses 1000 not necessarily different odd primes, and then $B$ chooses half of them and writes them on a blackboard. In each turn a player chooses a positive integer $n$, erases some primes $p_1$, $p_2$, $\dots$, $p_n$ from the blackboard and writes all the prime factors of $p_1 p_2 \dotsm p_n - 2$ instead (if a prime occurs several times in the prime factorization of $p_1 p_2 \dotsm p_n - 2$, it is written as many times as it occurs). Player $A$ starts, and the player whose move leaves the blackboard empty loses the game. Prove that one of the two players has a winning strategy and determine who. Remark: Since 1 has no prime factors, erasing a single 3 is a legal move.

The square \[ \begin{tabular}{|c|c|c|} \hline 50&\textit{b}&\textit{c}\\ \hline \textit{d}&\textit{e}&\textit{f}\\ \hline \textit{g}&\textit{h}&2\\ \hline \end{tabular} \]is a multiplicative magic square. That is, the product of the numbers in each row, column, and diagonal is the same. If all the entries are positive integers, what is the sum of the possible values of $ g$? $ \textbf{(A)}\ 10 \qquad \textbf{(B)}\ 25 \qquad \textbf{(C)}\ 35 \qquad \textbf{(D)}\ 62 \qquad \textbf{(E)}\ 136$

Find all natural numbers \(n\) for which there exists an even natural number \(a\) such that the number \[ (a - 1)(a^2 - 1)\cdots(a^n - 1) \] is a perfect square.

A pair of positive integers $(a,b)$ is called an [b]average couple[/b] if there exist positive integers $k$ and $c_1, \dots, c_k$ for which \[\frac{c_1+c_2+\cdots+c_k}{k}=a\qquad \text{and} \qquad \frac{s(c_1)+s(c_2)+\cdots+s(c_k)}{k}=b\] where $s(n)$ denotes the sum of digits of $n$ in decimal representation. Find the number of average couples $(a,b)$ for which $a,b<10^{10}$.

Find all pairs of primes $(p, q)$ for which $p-q$ and $pq-q$ are both perfect squares.

Let $a>k$ be natural numbers and $r_1<r_2<\dots r_n,s_1<s_2<\dots <s_n$ be sequences of natural numbers such that: $(a^{r_1}+k)(a^{r_2}+k)\dots (a^{r_n}+k)=(a^{s_1}+k)(a^{s_2}+k)\dots (a^{s_n}+k)$ Prove that these sequences are equal.

Let $p$ and $q$ be prime numbers such that $p^2+pq+q^2$ is perfect square. Prove that $p^2-pq+q^2$ is prime

Prove that the number $\overline{40...0}9$ (with at least one zero) is not a perfect square. (VA Senderov)