Every integer from 1 to 64 is written in an \(8 \times 8\) table. Prove that no matter the order these numbers are written, there are two adjacent numbers which are at least \(5\) apart. (Numbers in cells which share a side are called adjacent).
A group of \(2n\) people were gathered together. Each person knew at least \(n\) of the other people present. Prove that it is possible to select 4 people and seat them around a table so that each person sits next to people they know. (\(n \geq 2\))
30 teams are taking part in a football championship. Prove that at any moment in the contest there will be two teams who have played the same number of matches up to that moment, assuming every team plays every other team exactly once by the end of the tournament.
What is the maximum difference between neighbouring numbers, whose sum of digits is divisible by 7?
Is it possible to place the numbers \(1, 2,\dots 12\) around a circle so that the difference between any two adjacent numbers is 3, 4, or 5?
In a corridor of length 100 m, 20 sections of red carpet are laid out. The combined length of the sections is 1000 m. What is the largest number there can be of distinct stretches of the corridor that are not covered by carpet, given that the sections of carpet are all the same width as the corridor?
It is known that a camera located at \(O\) cannot see the objects \(A\) and \(B\), where the angle \(AOB\) is greater than \(179^\circ\). 1000 such cameras are placed in a Cartesian plane. All of the cameras simultaneously take a picture. Prove that there will be a picture taken in which no more than 998 cameras are visible.
The sum of 100 natural numbers, each of which is no greater than 100, is equal to 200. Prove that it is possible to pick some of these numbers so that their sum is equal to 100.
A conference was attended by a finite group of scientists, some of whom are friends. It turned out that every two scientists, who have an equal number of friends at the conference, do not have friends in common. Prove that there is a scientist who has exactly one friend among the conference attendees.
A white plane is arbitrarily sprinkled with black ink. Prove that for any positive \(l\) there exists a line segment of length \(l\) with both ends of the same colour.