Prove that the product of numbers $1, 2, ..., n$ ($n \ge 2$) is divisible by their sum if and only if the number $n + 1$ is not prime.

Prove that for any integer $n$ the number $n (n^2 + 5)$ is divisible by $6$.

The natural numbers $n$ and $z$ are relatively prime and greater than $1$. For $k = 0, 1, 2,..., n - 1$ let $s(k) = 1 + z + z^2 + ...+ z^k.$ Prove that: a) At least one of the numbers $s(k)$ is divisible by $n$. b) If $n$ and $z - 1$ are also coprime, then already one of the numbers $s(k)$ with $k = 0,1, 2,..., n- 2$ is divisible by $n$.

Show that the number $5^{2n+1}2^{n+2}+3^{n+2}2^{2n+1}$ is divisible by $19$ for every non-negative integer $n$.

Find all pairs $(x, y)$ of integers satisfying the following condition: each of the numbers $x^3 + y$ and $x + y^3$ is divisible by $x^2 + y^2$ . (S Zlobin)

Prove that if $n$ is a natural number such that both $3n+1$ and $4n+1$ are squares, then $n$ is divisible by $56$.

Find the maximal integer $ M$ with nonzero last digit (in its decimal representation) such that after crossing out one of its digits (not the first one) we can get an integer that divides $M$. (A Galochkin)

For which integer $n$ is $N = 20^n + 16^n - 3^n - 1$ divisible by $323$?

How many integers in the set $\{1, 2 ,..., 2010\}$ divide $5^{2010!}- 3^{2010!}$?

Let $n$ be a positive integer. Prove that $a(n) = n^5 +5^n$ is divisible by $11$ if and only if $b(n) = n^5 · 5^n +1$ is divisible by $11$. [i](Walther Janous)[/i]

A natural number is written in each box of the $13 \times 13$ grid area. Prove that you can choose $2$ rows and $4$ columns such that the sum of the numbers written at their $8$ intersections is divisible by $8$.

How many numbers $\overline{abcd}$ with different digits satisfy the following property: if we replace the largest digit with the digit $1$ results in a multiple of $30$?

All the two-digit numbers from $19$ to $80$ are written in a line without spaces. Is the obtained number $192021....7980$ divisible by $1980$?

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?

Find the minimum value of $n$ such that, among any $n$ integers, there are three whose sum is divisible by $3$.

Let $a, b$ and $n$ be positive integers such that $ b$ is divisible by $a^n$. Prove that $(a+1)^b-1$ is divisible by $a^{n+1}$.

Given a positive integer $k$. Find the condition of positive integer $m$ over $k$ such that there exists only one positive integer $n$ satisfying $$n^m | 5^{n^k} + 1,$$

The lettes $A,C,F,H,L$ and $S$ represent six not necessarily distinct decimal digits so that $S \ne 0$ and $F \ne 0$. We form the two six-digit numbers $SCHLAF$ and $FLACHS$. Show that the difference of these two numbers is divisible by $271$ if and only if $C=L$ and $H=A$. [i]Remark:[/i] The words "Schlaf" and "Flachs" are German for "sleep" and "flax".

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

Compute the number of functions $f : \{1, 2,... , 2550\} \to \{61, 80, 84\}$ such that $\sum_{k=1}^{2550} f(k)$ is divisible by $3$.

We want to write down as many distinct positive integers as possible, so that no two numbers on our list have a sum or a difference divisible by $2019$. At most how many integers can appear on such a list?

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$.

Let $a,b,c$ be positive integers such that $a|b^2, b|c^2$ and $c|a^2$. Prove that $abc|(a+b+c)^{7}$

The natural number $a_n$ is obtained by writing together and ordered, in decimal notation , all natural numbers between $1$ and $n$. So we have for example that $a_1 = 1$,$a_2 = 12$, $a_3 = 123$, $. . .$ , $a_{11} = 1234567891011$, $...$ . Find all values of $n$ for which $a_n$ is not divisible by $3$.

Thomas and Nils are playing a game. They have a number of cards, numbered $1, 2, 3$, et cetera. At the start, all cards are lying face up on the table. They take alternate turns. The person whose turn it is, chooses a card that is still lying on the table and decides to either keep the card himself or to give it to the other player. When all cards are gone, each of them calculates the sum of the numbers on his own cards. If the difference between these two outcomes is divisible by $3$, then Thomas wins. If not, then Nils wins. (a) Suppose they are playing with $2018$ cards (numbered from $1$ to $2018$) and that Thomas starts. Prove that Nils can play in such a way that he will win the game with certainty. (b) Suppose they are playing with $2020 $cards (numbered from $1$ to $2020$) and that Nils starts. Which of the two players can play in such a way that he wins with certainty?