This website contains problems from math contests. Problems and corresponding tags were obtained from the Art of Problem Solving website.

Tags were heavily modified to better represent problems.

AND:
OR:
NO:

Found problems: 59

1997 Estonia National Olympiad, 4

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.

2016 Singapore Senior Math Olympiad, 2

Let $n$ be a positive integer. Determine the minimum number of lines that can be drawn on the plane so that they intersect in exactly $n$ distinct points.

1961 Putnam, B2

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?$

1962 Czech and Slovak Olympiad III A, 3

Let skew lines $PM, QN$ be given such that $PM\perp PQ\perp QN$. Let a plane $\sigma\perp PQ$ containing the midpoint $O$ of segment $PQ$ be given and in it a circle $k$ with center $O$ and given radius $r$. Consider all segments $XY$ with endpoint $X, Y$ on lines $PM, QN$, respectively, which contain a point of $k$. Show that segments $XY$ have the same length. Find the locus of all such points $X$.

1976 Czech and Slovak Olympiad III A, 6

Consider two non-parallel half-planes $\pi,\pi'$ with the common boundary line $p.$ Four different points $A,B,C,D$ are given in the half-plane $\pi.$ Similarly, four points $A',B',C',D'\in\pi'$ are given such that $AA'\parallel BB'\parallel CC'\parallel DD'$. Moreover, none of these points lie on $p$ and the points $A,B,C,D'$ form a tetrahedron. Show that the points $A',B',C',D$ also form a tetrahedron with the same volume as $ABCD'.$

1999 Tournament Of Towns, 3

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)

2002 Junior Balkan Team Selection Tests - Moldova, 2

$64$ distinct points are positioned in the plane so that they determine exactly $2003$ different lines. Prove that among the $64$ points there are at least $4$ collinear points.

1973 Putnam, A6

Tags: Putnam , geometry , lines
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.

2009 All-Russian Olympiad Regional Round, 11.5

We drew several straight lines on the plane and marked all of them intersection points. How many lines could be drawn? if one point is marked on one of the drawn lines, on the other - three, and on the third - five? Find all possible options and prove that there are no others.

2022 Turkey EGMO TST, 5

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.

2018 Brazil EGMO TST, 4

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.

2011 Tournament of Towns, 5

In the plane are $10$ lines in general position, which means that no $2$ are parallel and no $3$ are concurrent. Where $2$ lines intersect, we measure the smaller of the two angles formed between them. What is the maximum value of the sum of the measures of these $45$ angles?

1989 Tournament Of Towns, (221) 5

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)

2000 Estonia National Olympiad, 5

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?

1979 Poland - Second Round, 4

Let $ S_k $ be the symmetry of the plane with respect to the line $ k $. Prove that equality holds for every lines $ a, b, c $ contained in one plane $$ S_aS_bS_cS_aS_bS_cS_bS_cS_aS_bS_cS_a = S_bS_cS_aS_bS_cS_aS_aS_bS_cS_aS_bS_c$$

1981 Austrian-Polish Competition, 8

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$?

1976 Vietnam National Olympiad, 5

$L, L'$ are two skew lines in space and $p$ is a plane not containing either line. $M$ is a variable line parallel to $p$ which meets $L$ at $X$ and $L'$ at $Y$. Find the position of $M$ which minimises the distance $XY$. $L''$ is another fixed line. Find the line $M$ which is also perpendicular to $L''$ .

1996 Chile National Olympiad, 3

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]

2011 Oral Moscow Geometry Olympiad, 2

Line $\ell $ intersects the plane $a$. It is known that in this plane there are $2011$ straight lines equidistant from $\ell$ and not intersecting $\ell$. Is it true that $\ell$ is perpendicular to $a$?

2016 Singapore Junior Math Olympiad, 5

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$)

2003 Oral Moscow Geometry Olympiad, 6

A circle is located on the plane. What is the smallest number of lines you need to draw so that, symmetrically reflecting a given circle relative to these lines (in any order a finite number of times), it could cover any given point of the plane?

2000 Estonia National Olympiad, 5

$N$ lines are drawn on the plane that divide it into a certain number for finite and endless parts. For which number of straight lines $n$ can there be more finite than infinite among the resulting level parts?

2009 Germany Team Selection Test, 2

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]

1985 All Soviet Union Mathematical Olympiad, 406

$n$ straight lines are drawn in a plane. They divide the plane onto several parts. Some of the parts are painted. Not a pair of painted parts has non-zero length common bound. Prove that the number of painted parts is not more than $\frac{n^2 + n}{3}$.

1998 German National Olympiad, 1

Find all possible numbers of lines in a plane which intersect in exactly $37$ points.