Prove that $(n!)!$ is a multiple of $(n!)^{(n-1)!}$

Let the number $ p $ be a prime divisor of the number $ 2 ^ {2 ^ k} + 1 $. Prove that $ p-1 $ is divisible by $ 2 ^ {k + 1} $.

Find all integers $a$ such that there is a prime number of $p\ge 5$ that divides ${p-1 \choose 2}$ $+ {p-1 \choose 3} a$ $+{p-1 \choose 4} a^2$+ ...+$ {p-1 \choose p-3} a^{p-5} .$

Prove that if $$\frac{p}{q}=1-\frac{1}{2} + \frac{1}{3}- \frac{1}{4} + ... -\frac{1}{1334} + \frac{1}{1335}$$ where $p, q \in Z_+$ then $p$ is divisible by $2003$.

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)

A set of $2003$ positive integers is given. Show that one can find two elements such that their sum is not a divisor of the sum of the other elements.

Find a pair of $2$ six-digit numbers such that, if they are written down side by side to form a twelve-digit number , this number is divisible by the product of the two original numbers. Find all such pairs of six-digit numbers. ( M . N . Gusarov, Leningrad)

1 - Prove that $55 < (1+\sqrt{3})^4 < 56$ . 2 - Find the largest power of $2$ that divides $\lceil(1+\sqrt{3})^{2n}\rceil$ for the positive integer $n$

Let $n$ be a positive integer. Prove that there exist integers $a_1, a_2,..., a_n$ such that for any integer $x$, the number $(... (((x^2 + a_1)^2 + a_2)^2 + ...)^2 + a_{n-1})^2 + a_n$ is divisible by $2n - 1$.

Show that there are infinitely many positive integers $n$ such that $n$ has at least two prime divisors and $20^n + 16^n$ is divisible by $n^2$.

The numbers $1, 2, 3, . . . , 624$ are paired in such a way that the sum of the two numbers in each pair is $625$. For example $1$ and $624$ form a pair, and $30$ and $595$ form a pair. In how many of the $312$ pairs does the smaller number evenly divide the larger?

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

For which $m > 1$ is $(m -1)!$ divisible by $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$.

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, for every integer $n > 2$, the number $$\left[\left( \sqrt[3]{n}+\sqrt[3]{n+2}\right)^3\right]+1$$ is divisible by $8$.

Find all positive integers $a,b$ with $a>1$ such that, $b$ is a divisor of $a-1$ and $2a+1$ is a divisor of $5b-3$.

A [i]change [/i] in a natural number $n$ consists of adding a pair of zeros between two digits or at the end of the decimal representation of $n$. A [i]countryman [/i] of $n$ is a number that can be obtained from one or more changes in $n$. For example. $40041$, $4410000$ and $4004001$ are all countrymen from $441$. Determine all the natural numbers $n$ for which there is a natural number m with the property that $n$ divides $m$ and all the countrymen of $m$.

Let $a,b,c,d$ be integers. Prove that $ 12$ divides $ (a-b) (a-c) (a-d) (b- c) (b-d) (c-d)$.

Determine which of the prime numbers $2,3,5,7,11,13,109,151,491$ divide $z =1963^{1965} -1963$.

Let the numbers $x_i \in \{-1, 1\}$ be given for $i = 1, 2,..., n$, satisfying $$x_1x_2 + x_2x_3 +... + x_{n-1}x_n + x_nx_1 = 0.$$ Prove that $n$ is divisible by $4$.

Let $a, b$, and $n$ be integers such that $a + b$ is divisible by $n$ and $a^2 + b^2$ is divisible by $n^2$. Prove that $a^m + b^m$ is divisible by $n^m$ for all positive integers $m$.

A positive integer $m$ is alpine if $m$ divides $2^{2n+1} + 1$ for some positive integer $n$. Show that the product of two alpine numbers is alpine.

Find all pairs of positive integers $(a,b)$ such that $8b+1$ is a multiple of $a$ and $8a+1$ is a multiple of $b$.

Determine the largest two-digit number $d$ with the following property: for any six-digit number $\overline{aabbcc}$ number $d$ is a divisor of the number $\overline{aabbcc}$ if and only if the number $d$ is a divisor of the corresponding three-digit number $\overline{abc}$. Note The numbers $a \ne 0, b$ and $c$ need not be different.