In the number \(1234096\dots\) each digit, starting with the 5th digit, is equal to the final digit of the sum of the previous 4 digits. Will the digits 8123 ever occur in a row in this number?
7 natural numbers are written around the edges of a circle. It is known that in each pair of adjacent numbers one is divisible by the other. Prove that there will be another pair of numbers that are not adjacent that share this property.
Is it possible to transport 50 stone blocks, whose masses are equal to \(370, 372,\dots, 468\) kg, from a quarry on seven 3-tonne trucks?
Is it possible to arrange 1000 line segments in a plane so that both ends of each line segment rest strictly inside another line segment?
Some open sectors – that is sectors of circles with infinite radii – completely cover a plane. Prove that the sum of the angles of these sectors is no less than \(360^\circ\).
On a line, there are 50 segments. Prove that either it is possible to find some 8 segments all of which have a shared intersection, or there can be found 8 segments, no two of which intersect.
10 magazines lie on a coffee table, completely covering it. Prove that you can remove five of them so that the remaining magazines will cover at least half of the table.
Every point in a plane, which has whole-number co-ordinates, is plotted in one of \(n\) colours. Prove that there will be a rectangle made out of 4 points of the same colour.
\(2n\) diplomats sit around a round table. After a break the same \(2n\) diplomats sit around the same table, but this time in a different order.
Prove that there will always be two diplomats with the same number of people sitting between them, both before and after the break.
A Cartesian plane is coloured in in two colours. Prove that there will be two points on the plane that are a distance of 1 apart and are the same colour.