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 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.
To a certain number, we add the sum of its digits and the answer we get is 2014. Give an example of such a number.
There are two symmetrical cubes. Is it possible to write some numbers on their faces so that the sum of the points when throwing these cubes on the upwards facing face on landing takes the values 1, 2, ..., 36 with equal probabilities?
Prove that for any positive integer \(n\), it is always possible to find a number, consisting of the digits \(1\) and \(2,\) that is divisible by \(2^n\). (For example, \(2\) is divisible by \(2\), \(12\) is divisible by \(4,\) \(112\) is divisible by \(8,\) \(2112\) is divisible by \(16\) and so on...).
Let’s call a natural number good if in its decimal record we have the numbers 1, 9, 7, 3 in succession, and bad if otherwise. (For example, the number 197,639,917 is bad and the number 116,519,732 is good.) Prove that there exists a positive integer \(n\) such that among all \(n\)-digit numbers (from \(10^{n-1}\) to \(10^{n-1}\)) there are more good than bad numbers.
Try to find the smallest possible \(n\).
An infinite sequence of digits is given. One may consider a finite set of consecutive digits and view it as a number in decimal expression, whose digits shall be read from left to right, as usual. Prove that, for any natural number \(n\) which is relatively prime with 10, you can choose a finite set of consecutive digits which gives you a multiple of \(n\).
Note that if you turn over a sheet on which numbers are written, then the digits 0, 1, 8 will not change and the digits 6 and 9 will switch places, whilst the others will lose their meaning. How many nine-digit numbers exist that do not change when a sheet is turned over?
Prove that in a group of 11 arbitrary infinitely long decimal numbers, it is possible to choose two whose difference contains either, in decimal form, an infinite number of zeroes or an infinite number of nines.