Found problems: 33
Divide each side of a triangle into $50$ equal parts, and each point of the division is joined to the opposite vertex by a segment. Calculate the number of intersection points determined by these segments.
Clarification : the vertices of the original triangle are not considered points of intersection or division.
The point $P$ lies inside the triangle $ABC$. A line is drawn through $P$ parallel to each side of the triangle. The lines divide $AB$ into three parts length $c, c', c"$ (in that order), and $BC$ into three parts length $a, a', a"$ (in that order), and $CA$ into three parts length $b, b', b"$ (in that order). Show that $abc = a'b'c' = a"b"c"$.
$ABC$ is a triangle. Take $a = BC$ etc as usual.
Take points $T_1, T_2$ on the side $AB$ so that $AT_1 = T_1T_2 = T_2B$. Similarly, take points $T_3, T_4$ on the side BC so that $BT_3 = T_3T_4 = T_4C$, and points $T_5, T_6$ on the side $CA$ so that $CT_5 = T_5T_6 = T_6A$.
Show that if $a' = BT_5, b' = CT_1, c'=AT_3$, then there is a triangle $A'B'C'$ with sides $a', b', c'$ ($a' = B'C$' etc).
In the same way we take points $T_i'$ on the sides of $A'B'C' $ and put $a'' = B'T_6', b'' = C'T_2', c'' = A'T_4'$.
Show that there is a triangle $A'' B'' C'' $ with sides $a'' b'' , c''$ and that it is similar to $ABC$.
Find $a'' /a$.
Let $n$ be a positive integer. Consider $n^2+1$ (closed, i.e. including endpoints) segments on a single line. Show that at least one of the following statements holds:
a) there are $n+1$ segments with non-empty intersection,
b) there are $n+1$ segments among which two of them are disjoint.
The segment $AB$ divides the square into two parts, in each of which a circle can be inscribed.
The radii of these circles are equal to $r_1$ and $r_2$ respectively, where $r_1> r_2$.
Find the length of $AB$.
Ziquan makes a drawing in the plane for art class. He starts by placing his pen at the origin, and draws a series of line segments, such that the $n^{th}$ line segment has length $n$. He is not allowed to lift his pen, so that the end of the $n^{th}$ segment is the start of the $(n + 1)^{th}$ segment. Line segments drawn are allowed to intersect and even overlap previously drawn segments.
After drawing a finite number of line segments, Ziquan stops and hands in his drawing to his art teacher. He passes the course if the drawing he hands in is an $N$ by $N$ square, for some positive integer $N$, and he fails the course otherwise. Is it possible for Ziquan to pass the course?
There are $2019$ segments $[a_1, b_1]$, $...$, $[a_{2019}, b_{2019}]$ on the line. It is known that any two of them intersect. Prove that they all have a point in common.
Two given circles $k_1$ and $k_2$ intersect at points $P$ and $Q$.
Construct a segment $AB$ through $P$ with the endpoints at $k_1$ and $k_2$ for which $AP \cdot PB$ is maximal.
Two circles $\omega_1$ and $\omega_2$, which have centers $O_1$ and $O_2$, respectively, intersect at $A$ and $B$. A line $\ell$ that passes through $B$ cuts to $\omega_1$ again at $C$ and cuts to $\omega_2$ again in $D$, so that points $C, B, D$ appear in that order. The tangents of $\omega_1$ and $\omega_2$ in $C$ and $D$, respectively, intersect in $E$. Line $AE$ intersects again to the circumscribed circumference of the triangle $AO_1O_2$ in $F$. Try that the length of the $EF$ segment is constant, that is, it does not depend on the choice of $\ell$.
Let $D$ be a point inside a triangle $ABC$ such that $|AC| -|AD| \geq 1$ and $|BC|- |BD| \geq 1.$ Prove that for any point $E$ on the segment $AB$, we have $|EC| -|ED| \geq 1.$
On a plane there is a finite set of $M$ points, no three of which are collinear . Some points are joined to others by line segments, with each point connected to no more than one line segment . If we have a pair of intersecting line segments $AB$ and $CD$ we decide to replace them with $AC$ and $BD$, which are opposite sides of quadrilateral $ABCD$. In the resulting system of segments we decide to perform a similar substitution, if possible, and so on . Is it possible that such substitutions can be carried out indefinitely?
(V.E. Kolosov)
You are given a segment $AB$. Find the locus of the vertices $C$ of acute-angled triangles $ABC$.
The $M$ set consists of $k$ non-intersecting segments on the line. It is possible to put an arbitrary segment shorter than $1$ cm on the line in such a way, that his ends will belong to $M$. Prove that the total sum of the segment lengths is not less than $1/k$ cm.
$ABC$ is a triangle with $\angle A = 90^o$. For a point $D$ on the side $BC$, the feet of the perpendiculars to $AB$ and $AC$ are $E$ and$ F$. For which point $D$ is $ EF$ a minimum?
Consider two parabolas $y = x^2$ and $y = x^2 - 1$. Let $U$ be the set of points between the parabolas (including the points on the parabolas themselves). Does $U$ contain a line segment of length greater than $10^6$ ?
Alexey Tolpygo
Given $4$ lines in the plane such that there are not $2$ parallel to each other or no $3$ concurrent, we consider the following $ 8$ segments: in each line we have $2$ consecutive segments determined by the intersections with the other three lines.
Prove that:
a) The lengths of the $ 8$ segments cannot be the numbers $1, 2, 3,4, 5, 6, 7, 8$ in some order.
b) The lengths of the $ 8$ segments can be $ 8$ different integers.
Let be given $n$ points, no three of which are on a line. All the segments with endpoints in these points are colored so that two segments with a common endpoint are of different colors. Determine the least number of colors for which this is possible
Let $(O)$ denote a circle with a chord $AB$, and let $W$ be the midpoint of the minor arc $AB$. Let $C$ stand for an arbitrary point on the major arc $AB$. The tangent to the circle $(O)$ at $C$ meets the tangents at $A$ and $B$ at points $X$ and $Y$, respectively. The lines $W X$ and $W Y$ meet $AB$ at points $N$ and $M$ , respectively. Does the length of segment $NM$ depend on position of $C$ ?
Given are $N$ points on the plane such that no three of them are collinear,which are coloured red,green and black.We consider all the segments between these points and give to each segment a [i]"value"[/i] according to the following conditions:
[b]i.[/b]If at least one of the endpoints of a segment is black then the segment's [i]"value"[/i] is $0$.
[b]ii.[/b]If the endpoints of the segment have the same colour,re or green,then the segment's [i]"value"[/i] is $1$.
[b]iii.[/b]If the endpoints of the segment have different colours but none of them is black,then the segment's [i]"value"[/i] is $-1$.
Determine the minimum possible sum of the [i]"values"[/i] of the segments.
On every side of a square $ABCD$, we consider three points different (to each other).
a) Find the number of line segments defined with endpoints those points , that do not lie on sides of the square.
b) If there are no three of the previous line segments passing through the same point, find how many of the intersection points of those segmens line in the interior of the square.
Let $C_1$ and $C_2$ be the outer circumferences of centers $O_1$ and $O_2$, respectively. The two tangents to the circumference $C_2$ are drawn by $O_1$, intersecting $C_1$ at $P$ and $P'$. The two tangents to the circumference $C_1$ are drawn by $O_2$, intersecting $C_2$ at $Q$ and $Q'$. Prove that the segment $PP'$ is equal to the segment $QQ'$.
Let $M$ and $N$ be two points on different sides of the square $ABCD$. Suppose that segment $MN$ divides the square into two tangential polygons. If $R$ and $r$ are radii of the circles inscribed in these polygons ($R> r$), calculate the length of the segment $MN$ in terms of $R$ and $r$.
(Moldova)
A triangle $ABC$ and two lines $\ell_1, \ell_2$ are given. Through an arbitrary point $D$ on the side $AB$, a line parallel to $\ell_1$ intersects the $AC$ at point $E$ and a line parallel to $\ell_2$ intersects the $BC$ at point $F$. Construct a point $D$ for which the segment $EF$ has the smallest length.
Show how to construct a line segment length $(a^4 + b^4)^{1/4}$ given segments lengths $a$ and $b$.
Given are $N$ points on the plane such that no three of them are collinear,which are coloured red,green and black.We consider all the segments between these points and give to each segment a [i]"value"[/i] according to the following conditions:
[b]i.[/b]If at least one of the endpoints of a segment is black then the segment's [i]"value"[/i] is $0$.
[b]ii.[/b]If the endpoints of the segment have the same colour,re or green,then the segment's [i]"value"[/i] is $1$.
[b]iii.[/b]If the endpoints of the segment have different colours but none of them is black,then the segment's [i]"value"[/i] is $-1$.
Determine the minimum possible sum of the [i]"values"[/i] of the segments.