What is the maximum number of kings you could place on a chess board such that no two of them were attacking each other – that is, no two kings are on horizontally, vertically, or diagonally adjacent squares. Kings can move in any direction, but only one square at a time.
Prove that it is not possible to completely cover an equilateral triangle with two smaller equilateral triangles.
51 points were thrown into a square of side 1 m. Prove that it is possible to cover some set of 3 points with a square of side 20 cm.
At the end of the month 5 workers were paid a total of £1,500 between them. Each wants to buy themselves a smartphone that costs £320. Prove that one of them will have to wait another month in order to do so.
The total age of a group of 7 people is 332 years. Prove that it is possible to choose three members of this group so that the sum of their ages is no less than 142 years.
Prove that within a group of \(51\) whole numbers there will be two whose difference of squares is divisible by \(100\).
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.
A \(3\times 3\) square is filled with the numbers \(-1, 0, +1\). Prove that two of the 8 sums in all directions – each row, column, and diagonal – will be equal.
100 people are sitting around a round table. More than half of them are men. Prove that there are two males sitting opposite one another.