Let \(m\) and \(n\) be integers. Prove that \(mn(m + n)\) is an even number.
The numbers \(1, 2,\dots ,99\) are written on 99 cards. Then the cards are shuffled and placed with the number facing down. On the blank side of the cards, the numbers \(1, 2, \dots , 99\) are once again written.
The sum of the two numbers on each card are calculated, and the product of these 99 summations is worked out. Prove that the end result will be an even number.
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.
Write the following rational numbers in the form of decimal fractions: a) \(\frac {1}{7}\); b) \(\frac {2}{7}\); c) \(\frac{1}{14}\); d) \(\frac {1}{17}\).
Let the number \(\alpha\) be given by the decimal:
a) \(0.101001000100001000001 \dots\);
b) \(0.123456789101112131415 \dots\).
Will this number be 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?
There are 4 weights and scales. How many loads that are different by weight can be accurately weighed using these weights, if
a) weights can be placed only on one side of the scales;
b) weights can be placed on both sides of the scales?
Will thought of a number: 1, 2 or 3. You can ask him only one question, to which he can answer “yes”, “no” or “I do not know”. Can you guess the number by asking just one question?