101 random points are chosen inside a unit square, including on the edges of the square, so that no three points lie on the same straight line. Prove that there exist some triangles with vertices on these points, whose area does not exceed 0.01.
Prove that it is not possible to completely cover an equilateral triangle with two smaller equilateral triangles.
51 points were thrown into a square of side 1 m. Prove that it is possible to cover some set of 3 points with a square of side 20 cm.
a) An axisymmetric convex 101-gon is given. Prove that its axis of symmetry passes through one of its vertices.
b) What can be said about the case of a decagon?
a) A piece of wire that is 120 cm long is given. Is it possible, without breaking the wire, to make a cube frame with sides of 10 cm?
b) What is the smallest number of times it will be necessary to break the wire in order to still produce the required frame?
Will the entire population of the Earth, all buildings and structures on it, fit into a cube with a side length of 3 kilometres?
a) What is the minimum number of pieces of wire needed in order to weld a cube’s frame?
b) What is the maximum length of a piece of wire that can be cut from this frame? (The length of the edge of the cube is 1 cm).
On a plane, there are 1983 points and a circle of unit radius. Prove that there is a point on the circle, from which the sum of the distances to these points is no less than 1983.
Is it possible to draw five lines from one point on a plane so that there are exactly four acute angles among the angles formed by them? Angles between not only neighboring rays, but between any two rays, can be considered.
Is it possible to draw this picture (see the figure), without taking your pencil off the paper and going along each line only once?