$9$ horizontal and $9$ vertical lines are drawn through a square. Prove that it is possible to select $20$ rectangles so that the sides of each rectangle is a segment of one of the given lines (including the sides of the square), and for any two of the $20$ rectangles, it is possible to cover one of them with the other (rotations are allowed).

Determine all real values of parameter $p$ such that the equation \[|x-2|+|y-3|+y=p\] is an equation of a ray in the plane $xy.$

Prove that it is impossible for seven distinct straight lines to be situated in the euclidean plane so as to have at least six points where exactly three of these lines intersect and at least four points where exactly two of these lines intersect.

Let $a$ and $b$ be given positive real numbers, with $a<b.$ If two points are selected at random from a straight line segment of length $b,$ what is the probability that the distance between them is at least $a?$

At a given plane with $2,000$ lines, all those with an odd number of different points of intersection with intersecting lines. a) Can there be an odd number of red lines if in the plane given there are no parallel lines? b) Can there be an odd number of red lines if none of any 3 given lines intersect at one point?

We are given three points $A,B,C$ on a semicircle. The tangent lines at $A$ and $B$ to the semicircle meet the extension of the diameter at points $M,N$ respectively. The line passing through $A$ that is perpendicular to the diameter meets $NC$ at $R$, and the line passing through $B$ that is perpendicular to the diameter meets $MC$ at $S$. If the line $RS$ meets the extension of the diameter at $Z$, prove that $ZC$ is tangent to the semicircle.

Given are $n$ different concentric circles on the plane.Inside the disk with the smallest radius (strictly inside it),we consider two distinct points $A,B$.We consider $k$ distinct lines passing through $A$ and $m$ distinct lines passing through $B$.There is no line passing through both $A$ and $B$ and all the lines passing through $k$ intersect with all the lines passing through $B$.The intersections do not lie on some of the circles.Determine the maximum and the minimum number of regions formed by the lines and the circles and are inside the circles.

There are $n$ distinct lines in three-dimensional space such that no two lines are parallel and no three lines meet at one point. What is the maximal possible number of planes determined by these $n$ lines? We say that a plane is determined if it contains at least two of the lines.

The plane has been partitioned into $N$ regions by three bunches of parallel lines. What is the least number of lines needed in order that $N > 1981$?

Find the greatest $n$ for which there exist $n$ lines in space, passing through a single point, such that any two of them form the same angle.

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]

Let $n> 2$ be a natural. Given $2n$ points in the plane, no $3$ are collinear. What is the maximum number of lines that can be drawn between them, without forming a triangle? [hide=original wording]Sea n > 2 un natural. Dados 2n puntos en el plano, tres a tres no colineales, Cual es el numero maximo de trazos que pueden dibujarse entre ellos, sin formar un triangulo?[/hide]

We are given $N$ lines ($N > 1$ ) in a plane, no two of which are parallel and no three of which have a point in common. Prove that it is possible to assign, to each region of the plane determined by these lines, a non-zero integer of absolute value not exceeding $N$ , such that the sum of the integers o n either side of any of the given lines is equal to $0$ . (S . Fomin, Leningrad)

Prove that for every set of $2n$ lines in the plane, such that there are no two parallel lines, there are two lines that divide the plane into four quadrants such that in each quadrant the number of unbounded regions is equal to $n$. [asy] unitsize(1cm); pair[] A, B; pair P, Q, R, S; A[1] = (0,5.2); B[1] = (6.1,0); A[2] = (1.5,5.5); B[2] = (3.5,0); A[3] = (6.8,5.5); B[3] = (1,0); A[4] = (7,4.5); B[4] = (0,4); P = extension(A[2],B[2],A[4],B[4]); Q = extension(A[3],B[3],A[4],B[4]); R = extension(A[1],B[1],A[2],B[2]); S = extension(A[1],B[1],A[3],B[3]); fill(P--Q--S--R--cycle, palered); fill(A[4]--(7,0)--B[1]--S--Q--cycle, paleblue); draw(A[1]--B[1]); draw(A[2]--B[2]); draw(A[3]--B[3]); draw(A[4]--B[4]); label("Bounded region", (3.5,3.7), fontsize(8)); label("Unbounded region", (5.4,2.5), fontsize(8)); [/asy]

On the plane, given are $n$ lines in general position, i.e. any two of them aren’t parallel and any three of them don’t concur. These lines divide the plane into several parts. What is a) the minimal, b) the maximal number of these parts that can be angles?

Let $ABC$ be an acute triangle and $D \in (BC) , E \in (AD)$ be mobile points. The circumcircle of triangle $CDE$ meets the median from $C$ of the triangle $ABC$ at $F$ Prove that the circumcenter of triangle $AEF$ lies on a fixed line.