A unit square contains 51 points. Prove that it is always possible to cover three of them with a circle of radius \(\frac{1}{7}\).
What is the minimum number of points necessary to mark inside a convex \(n\)-sided polygon, so that at least one marked point always lies inside any triangle whose vertices are shared with those of the polygon?
A plane contains \(n\) straight lines, of which no two are parallel. Prove that some of the angles will be smaller than \(180^\circ/n\).
Several chords are drawn through a unit circle. Prove that if each diameter intersects with no more than \(k\) chords, then the total length of all the chords is less than \(\pi k\).
Several circles, whose total length of circumferences is 10, are placed inside a square of side 1. Prove that there will always be some straight line that crosses at least four of the circles.
Cut an arbitrary triangle into 3 parts and out of these pieces construct a rectangle.
Fill an ordinary chessboard with the tiles shown in the figure.
From the set of numbers 1 to \(2n\), \(n + 1\) numbers are chosen. Prove that among the chosen numbers there are two, one of which is divisible by another.
a) In Wonderland, there are three cities \(A\), \(B\) and \(C\). 6 roads lead from city \(A\) to city \(B\), and 4 roads lead from city \(B\) to city \(C\). How many ways can you travel from \(A\) to \(C\)?
b) In Wonderland, another city \(D\) was built as well as several new roads – two from \(A\) to \(D\) and two from \(D\) to \(C\). In how many ways can you now get from city \(A\) to city \(C\)?
How many distinct seven-digit numbers exist? It is assumed that the first digit cannot be zero.