All decimal digits of some natural number are $1,3,7$, and $9$. Prove that one can rearrange its digits so as to obtain a number divisible by $7$.

Let $x, y, z$ be positive integers and $p$ a prime such that $x <y <z <p$. Also $x^3, y^3, z^3$ leave the same remainder when divided by $p$. Prove that $x + y + z$ divides $x^2 + y^2 + z^2$.

Show that if $m$ and $n$ are integers such that $m^2 + mn + n^2$ is divisible by $9$, then they must both be divisible by $3$.

Does there exist an even positive integer $n$ for which $n+1$ is divisible by $5$ and the two numbers $2^n + n$ and $2^n -1$ are co-prime?

Show that, if $m$ and $n$ are non-zero integers of like parity, and $n^2 -1$ is divisible by $m^2 - n^2 + 1$, then $m^2 - n^2 + 1$ is the square of an integer. Amer. Math. Monthly

A quadruple $(p, a, b, c)$ of positive integers is called a Leiden quadruple if - $p$ is an odd prime number, - $a, b$, and $c$ are distinct and - $ab + 1, bc + 1$ and $ca + 1$ are divisible by $p$. a) Prove that for every Leiden quadruple $(p, a, b, c)$ we have $p + 2 \le \frac{a+b+c}{3}$ . b) Determine all numbers $p$ for which a Leiden quadruple $(p, a, b, c)$ exists with $p + 2 = \frac{a+b+c}{3} $

Prove that for every integer $n$ the expression $n^3-9n + 27$ is not divisible by $81$.

Let $m$ and $n$ be positive integers with $m > n \ge 2$. Set $S =\{1,2,...,m\}$, and set $T = \{a_1,a_2,...,a_n\}$ is a subset of $S$ such that every element of $S$ is not divisible by any pair of distinct elements of $T$. Prove that $$\frac{1}{a_1}+\frac{1}{a_2}+ ...+ \frac{1}{a_n} < \frac{m+n}{m}$$

Find all polynomials $p(x)$ with integer coefficients such that for each positive integer $n$, the number $2^n - 1$ is divisible by $p(n)$.

Prove that the number $9^n+8^n+7^n+6^n-4^n-3^n-2^n-1^n$ is divisible by $10$ for all non-negative $n$.

We consider all $14$-digit positive integers, divisible by $18$, whose digits are exclusively $ 1$ and $2$, but there are no consecutive digits $2$. How many of these numbers are there?

Does there exist an integer having the form $444...4443$ (all fours, and ending with a three) that is divisible by $13$? If so, give an integer having that form that is divisible by $13$, if not, prove that such an integer cannot exist.

Given $m, n$ such that $m > n^{n-1}$ and the number $m+1$, $m+2$,$ ...$, $m+n$ are composite. Prove that there exist distinct primes $p_1, p_2, ..., p_n$ such that $m + k$ is divisible by $p_k$ for each $k = 1, 2, ...$

Let $k \ge 1$ be a positive integer. Prove that there exist exactly $3^{k-1}$ natural numbers $n$ with the following properties: (i) $n$ has exactly $k$ digits (in decimal representation), (ii) all the digits of $n$ are odd, (iii) $n$ is divisible by $5$, (iv) the number $m = n/5$ has $k$ odd digits

Show that there are infinitely many positive integers n such that $2\underbrace{555...55}_{n}3$ is divisible by $2553$.

Determine every prime numbers $p$ and $q , p \le q$ for which $pq | (5^p - 2^ p )(7^q -2 ^q )$

On the squares $a1, a2,... , a8$ of a chessboard there are respectively $2^0, 2^1, ..., 2^7$ grains of oat, on the squares $b8, b7,..., b1$ respectively $2^8, 2^9, ..., 2^{15}$ grains of oat, on the squares $c1, c2,..., c8$ respectively $2^{16}, 2^{17}, ..., 2^{23}$ grains of oat etc. (so there are $2^{63}$ grains of oat on the square $h1$). A knight starts moving from some square and eats after each move all the grains of oat on the square to which it had jumped, but immediately after the knight leaves the square the same number of grains of oat reappear. With the last move the knight arrives to the same square from which it started moving. Prove that the number of grains of oat eaten by the knight is divisible by $3$.

Prove that there are infinitely many different natural numbers of the form $k^2 + 1$, $k \in N$ that have no real divisor of this form.

Let $p$ be an odd prime number. Prove that there exists a unique integer $k$ such that $0 \le k \le p^2$ and $p^2$ divides $k(k + 1)(k + 2) ... (k + p - 3) - 1$. Malik Talbi

Let $a, b, c$ be three integers such that $a + b + c$ is divisible by $13$. Prove that $$a^{2007}+b^{2007}+c^{2007}+2 \cdot 2007abc$$ is divisible by $13$.

Let $a, b, c$ and $d$ be four integers such that $7a + 8b = 14c + 28d$. Prove that the product $a\cdot b$ is always divisible by $14$.

Prove that if $p$ is an odd prime, then $p^2(p^2 -1999)$ is divisible by $6$ but not by $12$.

Suppose that primes $a_1, a_2, . . . , a_p$ form an increasing arithmetic progression and $a_1 > p$. Prove that if $p$ is a prime, then the difference of the progression is divisible by $p$.

Find the number $\overline {523abc}$ divisible by $7, 8$ and $9$.

How many functions $f : \{1, 2, . . . , 16\} \to \{1, 2, . . . , 16\}$ have the property that $f(f(x))-4x$ is divisible by $17$ for all integers $1 \le x \le 16$?