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

2005 Sharygin Geometry Olympiad, 18
Tags: concurrency , concurrent , symmetry , lines , Circumcenter , geometry
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?

2009 Germany Team Selection Test, 2
Tags: geometry , point set , combinatorial geometry , lines , IMO Shortlist
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]

2011 Sharygin Geometry Olympiad, 18
Tags: geometry , combinatorial geometry , lines , Dissecting plane , Sharygin Geometry Olympiad
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?

II Soros Olympiad 1995 - 96 (Russia), 10.7
Tags: geometry , inradius , lines
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]

2021 Durer Math Competition (First Round), 5
Tags: combinatorial geometry , combinatorics , lines , planes , 3D geometry , geometry
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.

1967 Swedish Mathematical Competition, 1
Tags: combinatorial geometry , combinatorics , rectangle , lines
$p$ parallel lines are drawn in the plane and $q$ lines perpendicular to them are also drawn. How many rectangles are bounded by the lines?

2001 239 Open Mathematical Olympiad, 6
Tags: combinatorics , lines
On the plane 100 lines are drawn, among which there are no parallel lines. From any five of these lines, some three pass through one point. Prove that there are two points such that each line contains at least of of them.

2008 Postal Coaching, 6
Tags: combinatorial geometry , lines , points
Suppose $n$ straight lines are in the plane so that there exist seven points such that any of these line passes through at least three of these points. Find the largest possible value of $n$.

2001 239 Open Mathematical Olympiad, 6
Tags: lines , Projective plane , combinatorics , block designs
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.

2013 Greece Team Selection Test, 4
Tags: combinatorics , counting , circles , lines
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.

2013 Greece Team Selection Test, 4
Tags: combinatorics , counting , circles , lines
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.

2009 QEDMO 6th, 2
Tags: combinatorics , Coloring , lines
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.)

1979 All Soviet Union Mathematical Olympiad, 280
Tags: combinatorial geometry , lines , orthogonal
Given the point $O$ in the space and $1979$ straight lines $l_1, l_2, ... , l_{1979}$ containing it. Not a pair of lines is orthogonal. Given a point $A_1$ on $l_1$ that doesn't coincide with $O$. Prove that it is possible to choose the points $A_i$ on $l_i$ ($i = 2, 3, ... , 1979$) in so that $1979$ pairs will be orthogonal: $A_1A_3$ and $l_2$, $A_2A_4$ and $l_3$,$ ...$ , $A_{i-1}A_{i+1}$ and $l_i$,$ ...$ , $A_{1977}A_{1979}$ and $l_{1978}$, $A_{1978}A_1$ and $l_{1979}$, $A_{1979}A_2$ and $l_1$

2011 IFYM, Sozopol, 4
Tags: geometry , Plane , points , lines
There are $n$ points in a plane. Prove that there exist a point $O$ (not necessarily from the given $n$) such that on each side of an arbitrary line, through $O$, lie at least $\frac{n}{3}$ points (including the points on the line).

1971 Poland - Second Round, 3
Tags: geometry , combinatorics , combinatorial geometry , 3D geometry , lines
There are 6 lines in space, of which no 3 are parallel, no 3 pass through the same point, and no 3 are contained in the same plane. Prove that among these 6 lines there are 3 mutually oblique lines.

1996 North Macedonia National Olympiad, 5
Tags: combinatorial geometry , combinatorics , equal angles , concurrent , lines
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.

1991 All Soviet Union Mathematical Olympiad, 537
Tags: combinatorial geometry , lines , integer sides
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?

1947 Moscow Mathematical Olympiad, 126
Tags: combinatorial geometry , combinatorics , convex , pentagon , lines
Given a convex pentagon $ABCDE$, prove that if an arbitrary point $M$ inside the pentagon is connected by lines with all the pentagon’s vertices, then either one or three or five of these lines cross the sides of the pentagon opposite the vertices they pass. Note: In reality, we need to exclude the points of the diagonals, because that in this case the drawn lines can pass not through the internal points of the sides, but through the vertices. But if the drawn diagonals are not considered or counted twice (because they are drawn from two vertices), then the statement remains true.

2016 IMAR Test, 2
Tags: combinatorial geometry , combinatorics , point , Intersection , lines , polygon
Given a positive integer $n$, does there exist a planar polygon and a point in its plane such that every line through that point meets the boundary of the polygon at exactly $2n$ points?

1983 Austrian-Polish Competition, 6
Tags: 3D geometry , lines , perpendicular , combinatorial geometry , combinatorics , geometry
Six straight lines are given in space. Among any three of them, two are perpendicular. Show that the given lines can be labeled $\ell_1,...,\ell_6$ in such a way that $\ell_1, \ell_2, \ell_3$ are pairwise perpendicular, and so are $\ell_4, \ell_5, \ell_6$.

1947 Putnam, A3
Tags: Putnam , geometry , polygon , lines
Given a triangle $ABC$ with an interior point $P$ and points $Q_1 , Q_2$ not lying on any of the segments $AB , AC ,BC,$ $AP ,BP ,CP,$ show that there does not exist a polygonal line $K$ joining $Q_1$ and $Q_2$ such that i) $K$ crosses each segment exactly once, ii) $K$ does not intersect itself iii) $K$ does not pass through $A, B , C$ or $P.$

Durer Math Competition CD Finals - geometry, 2017.C2
Tags: geometry , isosceles , right triangle , lines
The triangle $ABC$ is isosceles and has a right angle at the vertex $A$. Construct all points that simultaneously satisfy the following two conditions: (i) are equidistant from points $A$ and $B$ (ii) heve distance exactly three times from point $C$ as far as from point $B$.

1981 Spain Mathematical Olympiad, 3
Tags: lines , 3D geometry , geometry , symmetry
Given the intersecting lines $ r$ and $s$, consider the lines $u$ and $v$ as such what: a) $u$ is symmetric to $r$ with respect to $s$, b) $v$ is symmetric to $s$ with respect to $r$ . Determine the angle that the given lines must form such that $u$ and $v$ to be coplanar.

2004 German National Olympiad, 2
Tags: circles , concurrent , lines , tangent , geometry
Let $k$ be a circle with center $M.$ There is another circle $k_1$ whose center $M_1$ lies on $k,$ and we denote the line through $M$ and $M_1$ by $g.$ Let $T$ be a point on $k_1$ and inside $k.$ The tangent $t$ to $k_1$ at $T$ intersects $k$ in two points $A$ and $B.$ Denote the tangents (diifferent from $t$) to $k_1$ passing through $A$ and $B$ by $a$ and $b$, respectively. Prove that the lines $a,b,$ and $g$ are either concurrent or parallel.

2018 Dutch IMO TST, 1
Tags: combinatorial geometry , combinatorics , lines
A set of lines in the plan is called [i]nice [/i]i f every line in the set intersects an odd number of other lines in the set. Determine the smallest integer $k \ge 0$ having the following property: for each $2018$ distinct lines $\ell_1, \ell_2, ..., \ell_{2018}$ in the plane, there exist lines $\ell_{2018+1},\ell_{2018+2}, . . . , \ell_{2018+k}$ such that the lines $\ell_1, \ell_2, ..., \ell_{2018+k}$ are distinct and form a [i]nice [/i] set.