Find the number of ways to select three distinct numbers from ${1, 2, . . . , 3n}$ with a sum divisible by $3$.

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

Denote by $P^{(n)}$ the set of all polynomials of degree $n$ the coefficients of which is a permutation of the set of numbers $\{2^0, 2^1,..., 2^n\}$. Find all pairs of natural numbers $(k,d)$ for which there exists a $n$ such that for any polynomial $p \in P^{(n)}$, number $P(k)$ is divisible by the number $d$. (Oleksii Masalitin)

Do there exist $10$ positive integers such that each of them is divisible by none of the other numbers but the square of each of these numbers is divisible by each of the other numbers? (Folklore)

Let $A = \{1,2,..., 100\}$ and $B$ is a subset of $A$ having $48$ elements. Show that $B$ has two distint elements $x$ and $y$ whose sum is divisible by $11$.

a) Let $a,n,m$ be natural numbers, $a > 1$. Prove that if $(a^m + 1)$ is divisible by $(a^n + 1)$ than $m$ is divisible by $n$. b) Let $a,b,n,m$ be natural numbers, $a>1, a$ and $b$ are relatively prime. Prove that if $(a^m+b^m)$ is divisible by $(a^n+b^n)$ than $m$ is divisible by $n$.

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

Prove the theorem: There is no natural number $ n > 1 $ such that the number $ 2^n - 1 $ is divisible by $ n $.

A natural number is called [i]chaotigal [/i] if it and its successor both have the sum of their digits divisible by $2021$. How many digits are in the smallest chaotigal number?

How many positive integers $x$ less than $10 000$ are there such that $2^x - x^2$ is divisible by $7$ ?

Find all pairs $(a, b)$ of natural numbers such that $$\frac{a^3 + 1}{2ab^2 + 1}$$ is an integer.

a) Suppose that $n$ is an odd integer. Prove that $k(n-k)$ is divisible by $2$ for all positive integers $k$. b) Find an integer $k$ such that $k(100-k)$ is not divisible by $11$. c) Suppose that $p$ is an odd prime, and $n$ is an integer. Prove that there is an integer $k$ such that $k(n-k)$ is not divisible by $p$. d) Suppose that $p,q$ are two different odd primes, and $n$ is an integer. Prove that there is an integer $k$ such that $k(n-k)$ is not divisible by any of $p,q$.

Let $a, b, c$, and $d$ be four distinct integers. Prove that $(a-b)(a-c)(a-d)(b-c)(b-d)(c-d)$ is divisible by $12$.

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

How many positive integers less than $1000$ have the property that the sum of the digits of each such number is divisible by $7$ and the number itself is divisible by $3$?

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

a) Show that the product of $5$ consecutive even integers is divisible by $15$. b) Determine the largest integer $D$ such that the product of $5$ consecutive even integers is always divisible by $D$.

For every $n$ positive integers we denote $$\frac{x_n}{y_n}=\sum_{k=1}^{n}{\frac{1}{k {n \choose k}}}$$ where $x_n, y_n$ are coprime positive integers. Prove that $y_n$ is not divisible by $2^n$ for any positive integers $n$. Ha Duy Hung, high school specializing in the Ha University of Education, Hanoi, Xuan Thuy, Cau Giay, Hanoi

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?

Prove that $1998! \left( 1+ \frac12 + \frac13 +...+\frac{1}{1998}\right)$ is an integer divisible by $1999$.

Do there exist $10000$ ten-digit numbers divisible by $7$, all of which can be obtained from one another by a reordering of their digits?

Find the largest integer $k$ such that $k$ divides $n^{55} - n$ for all integer $n$.

Prove that if the product $1\cdot 2\cdot ...\cdot n$ ($n> 3$) is not divisible by $n + 1$, then $n + 1$ is prime.

Prove that for every positive integer $n$ there are positive integers $a$ and $b$ exist with $n | 4a^2 + 9b^2 -1$.

Let $M\subset \{1, 2, 3, . . . , 2007\}$ a set with the following property: Among every three numbers one can always choose two from $M$ such that one is divisible by the other. How many numbers can $M$ contain at most?