An endless board is painted in three colours (each cell is painted in one of the colours). Prove that there are four cells of the same colour, located at the vertices of the rectangle with sides parallel to the side of one cell.
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.
Let \(a\), \(b\), \(c\) be integers; where \(a\) and \(b\) are not equal to zero.
Prove that the equation \(ax + by = c\) has integer solutions if and only if \(c\) is divisible by \(d = \mathrm{GCD} (a, b)\).
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.
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.
Definition. The sequence of numbers \(a_0, a_1, \dots , a_n, \dots\), which, with the given \(p\) and \(q\), satisfies the relation \(a_{n + 2} = pa_{n + 1} + qa_n\) (\(n = 0,1,2, \dots\)) is called a linear recurrent sequence of the second order.
The equation \[x^2-px-q = 0\] is called a characteristic equation of the sequence \(\{a_n\}\).
Prove that, if the numbers \(a_0\), \(a_1\) are fixed, then all of the other terms of the sequence \(\{a_n\}\) are uniquely determined.
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.