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?
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.
On a plane \(n\) randomly placed lines are given. What is the number of triangles formed by them?