Prove that amongst numbers written only using the number 1, i.e.: 1, 11, 111, etc, there is a number than is divisible by 1987.
Prove that there is a power of 3 that ends in 001.
The numbers \(1, 2, \dots , 9\) are divided into three groups. Prove that the product of the numbers in one of the groups will always be no less than 72.
Prove that in any group of 10 whole numbers there will be a few whose sum is divisible by 10.
11 scouts are working on 5 different badges. Prove that there will be two scouts \(A\) and \(B\), such that every badge that \(A\) is working towards is also being worked towards by \(B\).
Prove that \(n^2 + 1\) is not divisible by \(3\) for any natural \(n\).
Prove there are no natural numbers \(a\) and \(b\), such as \(a^2 - 3b^2 = 8\).
The board has the form of a cross, which is obtained if corner boxes of a square board of \(4 \times 4\) are erased. Is it possible to go around it with the help of the knight chess piece and return to the original cell, having visited all the cells exactly once?
Prove that a graph with \(n\) vertices, the degree of each of which is at least \(\frac{n-1}{2}\), is connected.
In the Far East, the only type of transport is a carpet-plane. From the capital there are 21 carpet-planes, from the city of Dalny there is one carpet-plane, and from all of the other cities there are 20. Prove that you can fly from the capital to Dalny (possibly with interchanges).