Prove that in a three-digit number, that is divisible by 37, you can always rearrange the numbers so that the new number will also be divisible by 37.
Prove that any \(n\) numbers \(x_1,\dots , x_n\) that are not pairwise congruent modulo \(n\), represent a complete system of residues, modulo \(n\).
Prove that for any natural number there is a multiple of it, the decimal notation of which consists of only 0 and 1.
Without calculating the answer to \(2^{30}\), prove that it contains at least two identical digits.
For what natural numbers \(a\) and \(b\) is the number \(\log_{a} b\) rational?
Prove that if \((m, 10) = 1\), then there is a repeated unit \(E_n\) that is divisible by \(m\). Will there be infinitely many repeated units?
Prove that the equation \(\frac {x}{y} + \frac {y}{z} + \frac {z}{x} = 1\) is unsolvable using positive integers.
Prove that the 13th day of the month is more likely to occur on a Friday than on other days of the week. It is assumed that we live in the Gregorian style calendar.
We are given 111 different natural numbers that do not exceed 500. Could it be that for each of these numbers, its last digit coincides with the last digit of the sum of all of the remaining numbers?
16 teams took part in a handball tournament where a victory was worth 2 points, a draw – 1 point and a defeat – 0 points. All teams scored a different number of points, and the team that ranked seventh, scored 21 points. Prove that the winning team drew at least once.