A \(99 \times 99\) chequered table is given, each cell of which is painted black or white. It is allowed (at the same time) to repaint all of the cells of a certain column or row in the colour of the majority of cells in that row or column. Is it always possible to have that all of the cells in the table are painted in the same colour?
There are several cities (more than one) in a country; some pairs of cities are connected by roads. It is known that you can get from every city to any other city by driving along several roads. In addition, the roads do not form cycles, that is, if you leave a certain city on some road and then move so as not to pass along one road twice, it is impossible to return to the initial city. Prove that in this country there are at least two cities, each of which is connected by a road with exactly one city.
Two points are placed inside a convex pentagon. Prove that it is always possible to choose a quadrilateral that shares four of the five vertices on the pentagon, such that both of the points lie inside or on the boundary the quadrilateral.
You are given 10 different positive numbers. In which order should they be named \(a_1, a_2, \dots , a_{10}\) such that the sum \(a_1 +2a_2 +3a_3 +\dots +10a_{10}\) is at its maximum?
A pentagon is inscribed in a circle of radius 1. Prove that the sum of the lengths of its sides and diagonals is less than 17.
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.
10 guests came to a party and each left a pair of shoes in the corridor (all guests have the same shoes). All pairs of shoes are of different sizes. The guests began to disperse one by one, putting on any pair of shoes that they could fit into (that is, each guest could wear a pair of shoes no smaller than his own). At some point, it was discovered that none of the remaining guests could find a pair of shoes so that they could leave. What was the maximum number of remaining guests?
On a plane, there are given 2004 points. The distances between every pair of points is noted. Prove that among these noted distances at least thirty numbers are different.
How can one measure out 15 minutes, using an hourglass of 7 minutes and 11 minutes?
Prove that, if \(b=a-1\), then \[(a+b)(a^2 +b^2)(a^4 +b^4)\dotsb(a^{32} +b^{32})=a^{64} -b^{64}.\]