Four lines in the plane intersect in six points. Each line is thus divided into two segments and two rays. Is it possible for the eight segments to have lengths $1, 2, 3, ... , 8$? Can the lengths of the eight segments be eight distinct integers?

There are $19$ lines in the plane dividing the plane into exactly $97$ pieces. (a) Prove that among these pieces there is at least one triangle. (b) Show that it is indeed possible to place $19$ lines in the above way.

Let $ k$ and $ n$ be integers with $ 0\le k\le n \minus{} 2$. Consider a set $ L$ of $ n$ lines in the plane such that no two of them are parallel and no three have a common point. Denote by $ I$ the set of intersections of lines in $ L$. Let $ O$ be a point in the plane not lying on any line of $ L$. A point $ X\in I$ is colored red if the open line segment $ OX$ intersects at most $ k$ lines in $ L$. Prove that $ I$ contains at least $ \dfrac{1}{2}(k \plus{} 1)(k \plus{} 2)$ red points. [i]Proposed by Gerhard Woeginger, Netherlands[/i]

On the plane are three straight lines $\ell_1, \ell_2,\ell_3$, forming a triangle, and the point $O$ is marked, the center of the circumscribed circle of this triangle. For an arbitrary point X of the plane, we denote by $X_i$ the point symmetric to the point X with respect to the line $\ell_i, i = 1,2,3$. a) Prove that for an arbitrary point $M$ the straight lines connecting the midpoints of the segments $O_1O_2$ and $M_1M_2, O_2O_3$ and $M_2M_3, O_3O_1$ and $M_3M_1$ intersect at one point, b) where can this intersection point lie?

On the plane $n$ points are chosen so that exactly $m$ of them lie on one straight line and no three points not included in these $m$ points lie on one straight line. What is the number of all lines, each of which contains at least two of these points?

There are $n$ straight lines in the plane such that each intersects exactly $1999$ of the others . Find all posssible values of $n$. (R Zhenodarov)

Consider a circle centered at $O$ with radius $r$ and a line $\ell$ not passing through $O$. A grasshopper is jumping to and fro between the points of the circle and the line, the length of each jump being $r$. Prove that there are at most $8$ points for the grasshopper to reach.

Determine the minimum number of lines that can be drawn on the plane so that they intersect in exactly $200$ distinct points. (Note that for $3$ distinct points, the minimum number of lines is $3$ and for $4$ distinct points, the minimum is $4$)

Which convex domains (figures) on a plane can contain an entire straight line? It is assumed that the figure is flat and does not degenerate into a straight line and is closed, that is, it contains all its boundary points.

Let there be a finite number of straight lines in the plane, none of which are three in one point to cut. Show that the intersections of these straight lines can be colored with $3$ colors so that that no two points of the same color are adjacent on any of the straight lines. (Two points of intersection are called [i]adjacent [/i] if they both lie on one of the finitely many straight lines and there is no other such intersection on their connecting line.)

There are $2017$ lines in the plane such that no three of them go through the same point. Turbo the snail sits on a point on exactly one of the lines and starts sliding along the lines in the following fashion: she moves on a given line until she reaches an intersection of two lines. At the intersection, she follows her journey on the other line turning left or right, alternating her choice at each intersection point she reaches. She can only change direction at an intersection point. Can there exist a line segment through which she passes in both directions during her journey?

In the plane, $n$ lines are drawn in general position (that is, there are neither two of them parallel nor three of them passing through the same point). Prove that it is possible to put a positive integer in each region (finite or infinite) determined by these lines so that for each line the sum of the numbers in the regions of a sdemiplane is equal to the sum of the numbers in the regions of the other semiplane. Note: A region is a set of points such that the straight line connecting any two of them it does not intersect any of the lines. For example, a line divides the plane into $2$ infinite regions and three lines into general position divide the plane into $7$ regions, some finite(s) and others infinite.

Let $N$ be the set of natural numbers, and let $f: N \to N$ be a function satisfying $f(x) + f(x + 2) < 2 f(x + 1)$ for any $x \in N$. Prove that there exists a straight line in the $xy$-plane which contains infinitely many points with coordinates $(n,f(n))$.

Let each of $m$ distinct points on the positive part of the $x$-axis be joined to $n$ distinct points on the positive part of the $y$-axis. Obtain a formula for the number of intersection points of these segments, assuming that no three of the segments are concurrent.

Three straight lines $\ell_1$, $\ell_2$ and $\ell_3$, forming a triangle, divide the plane into $7$ parts. Each of the points $M_1$, $M_2$ and $M_3$ lies in one of the angles, vertical to some angle of the triangle. The distance from $M_1$ to straight lines $\ell_1$, $\ell_2$ and $\ell_3$ are equal to $7,3$ and $1$ respectively The distance from $M_2$ to the same lines are $4$, $1$ and $3$ respectively. For $M_3$ these distances are $3$, $5$ and $2$. What is the radius of the circle inscribed in the triangle? [hide=second sentence in Russian]Каждая из точек М_1, М_2 и М_з лежит в одном из углов, вертикальном по отношению к какому-то углу треугольника.[/hide]

On the plane 1000 lines are drawn, among which there are no parallel lines. From any seven of these lines, some three pass through one point. But no more than 500 lines pass through each point. Prove that there are three points such that each line contains at least of of them.