We are given 51 two-digit numbers – we will count one-digit numbers as two-digit numbers with a leading 0. Prove that it is possible to choose 6 of these so that no two of them have the same digit in the same column.
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.
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. Prove that for any natural number \(n\) that is relatively prime with a number 10, you can choose a group of consecutive digits, which when written as a sequence of digits, gives a resulting number written by these digits which is divisible by \(n\).
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.