Found problems: 75
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 $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?
Two straight lines $a$ and $b$ are given and also points $A$ and $B$. Point $X$ slides along the line $a$, and point $Y$ slides along the line $b$, so that $AX \parallel BY$. Find the locus of the intersection point of $AY$ with $XB$.
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.
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.
$2019$ point grasshoppers sit on a line. At each move one of the grasshoppers jumps over another one and lands at the point the same distance away from it. Jumping only to the right, the grasshoppers are able to position themselves so that some two of them are exactly $1$ mm apart. Prove that the grasshoppers can achieve the same, jumping only to the left and starting from the initial position.
(Sergey Dorichenko)
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.$
A set of $n^2$ counters are labeled with $1,2,\ldots, n$, each label appearing $n$ times. Can one arrange the counters on a line in such a way that for all $x \in \{1,2,\ldots, n\}$, between any two successive counters with the label $x$ there are exactly $x$ counters (with labels different from $x$)?
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.
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]
Given triangle $\vartriangle A_1A_2A_3$ and a straight line $\ell$ outside it. The angles between the lines $A_1A_2$ and $A_2A_3, A_1A_2$ and $A_2A_3, A_2A_3$ and $A_3A_1$ are equal to $a_3, a_1$ and $a_2$, respectively. The straight lines are drawn through points $A_1, A_2, A_3$ forming with $\ell$ angles of $\pi -a_1, \pi -a_2, \pi -a_3$, respectively. All angles are counted in the same direction from $\ell$ . Prove that these new lines meet at one point.
$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''$ .
$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?
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.
Consider a circle and a point $A$ outside it. We start moving from $A$ along a closed broken line consisting of segments of tangents to the circle (the segment itself should not necessarily be tangent to the circle) and terminate back at $A$. (On the links of the broken line are solid.) We label parts of the segments with a plus sign if we approach the circle and with a minus sign otherwise. Prove that the sum of the lengths of the segments of our path, with the signs given, is zero.
[img]https://cdn.artofproblemsolving.com/attachments/3/0/8d682813cf7dfc88af9314498b9afcecdf77d2.png[/img]
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?
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$.
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.
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.
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$
We are given a figure bounded by arc $AC$ of a circle, and a broken line $ABC$, with the arc and broken line being on opposite sides of the chord $AC$. Construct a line passing through the mid-point of arc $AC$ and dividing the area of the figure into two regions of equal area.
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.
Let $n$ be a fixed positive integer and fix a point $O$ in the plane. There are $n$ lines drawn passing through the point $O$. Determine the largest $k$ (depending on $n$) such that we can always color $k$ of the $n$ lines red in such a way that no two red lines are perpendicular to each other.
[i]Proposed by Nikola Velov[/i]
Find all possible numbers of lines in a plane which intersect in exactly $37$ points.
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?