Prove that, in a circle of radius 10, you cannot place 400 points so that the distance between each two points is greater than 1.
101 points are marked on a plane; not all of the points lie on the same straight line. A red pencil is used to draw a straight line passing through each possible pair of points. Prove that there will always be a marked point on the plane through which at least 11 red lines pass.
a) Can 4 points be placed on a plane so that each of them is connected by segments with three points (without intersections)?
b) Can 6 points be placed on a plane and connected by non-intersecting segments so that exactly 4 segments emerge from each point?
Is it possible to arrange 1000 line segments in a plane so that both ends of each line segment rest strictly inside another line segment?
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.
There are \(n\) points on the plane. How many lines are there with endpoints at these points?
On a plane \(n\) randomly placed lines are given. What is the number of triangles formed by them?
On two parallel lines \(a\) and \(b\), the points \(A_1, A_2, \dots , A_m\) and \(B_1, B_2, \dots , B_n\) are chosen, respectively, and all of the segments of the form \(A_iB_j\), where \(1 \leq i \leq m\), \(1 \leq j \leq n\). How many intersection points will there be if it is known that no three of these segments intersect at one point?