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\).
Two people toss a coin: one tosses it 10 times, the other – 11 times. What is the probability that the second person’s coin showed heads more times than the first?
It is known that in a convex \(n\)-gon (\(n > 3\)) no three diagonals pass through one point. Find the number of points (other than the vertex) where pairs of diagonals intersect.
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.
It is known that \[35! = 10333147966386144929 * 66651337523200000000.\] Find the number replaced by an asterisk.
10 people collected a total of 46 mushrooms in a forest. It is known that no two people collected the same number of mushrooms. How many mushrooms did each person collect?
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.
In a square which has sides of length 1 there are 100 figures, the total area of which sums to more than 99. Prove that in the square there is a point which belongs to all of these figures.
On a \(100 \times 100\) board 100 rooks are placed that cannot capturing one another.
Prove that an equal number of rooks is placed in the upper right and lower left cells of \(50 \times 50\) squares.
On a board of size \(8 \times 8\), two in turn colour the cells so that there are no corners of three coloured squares. The player who can’t make a move loses. Who wins with the right strategy?