Prove that for any number \(d\), which is not divisible by \(2\) or by \(5\), there is a number whose decimal notation contains only ones and which is divisible by \(d\).
Reception pupil Peter knows only the number 1. Prove that he can write a number divisible by 2001.
How many distinct seven-digit numbers exist? It is assumed that the first digit cannot be zero.
We call a natural number “fancy”, if it is made up only of odd digits. How many four-digit “fancy” numbers are there?
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 amongst any 11 different decimal fractions of infinite length, there will be two whose digits in the same column – 10ths, 100s, 1000s, etc – coincide (are the same) an infinite number of times.
How many six-digit numbers exist, for which each succeeding number is smaller than the previous one?
Why are the equalities \(11^2 = 121\) and \(11^3 = 1331\) similar to the lines of Pascal’s triangle? What is \(11^4\) equal to?
How many four-digit numbers can be made using the numbers 1, 2, 3, 4 and 5, if:
a) no digit is repeated more than once;
b) the repetition of digits is allowed;
c) the numbers should be odd and there should not be any repetition of digits?
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.