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.
a) A square of area 6 contains three polygons, each of area 3. Prove that among them there are two polygons that have an overlap of area no less than 1.
b) A square of area 5 contains nine polygons of area 1. Prove that among them there are two polygons that have an overlap of area no less than \(\frac{1}{9}\).
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 sack contains 70 marbles, 20 red, 20 blue, 20 yellow, and the rest black or white. What is the smallest number of marbles that need to be removed from the sack, without looking, in order for there to be no less than 10 marbles of the same colour among the removed marbles.
Some points from a finite set are connected by line segments. Prove that two points can be found which have the same number of line segments connected to them.
There are \(2k+1\) cards numbered with the numbers \(1\) to \(2k+1\). What is the largest number of cards that can be chosen so that no number on a chosen card is equal to the sum of two numbers from two other chosen cards?