Found problems: 85
In the plane a point $O$ is and a sequence of points $P_1, P_2, P_3, \ldots$ are given. The distances $OP_1, OP_2, OP_3, \ldots$ are $r_1, r_2, r_3, \ldots$ Let $\alpha$ satisfies $0 < \alpha < 1.$ Suppose that for every $n$ the distance from the point $P_n$ to any other point of the sequence is $\geq r^{\alpha}_n.$ Determine the exponent $\beta$, as large as possible such that for some $C$ independent of $n$
\[r_n \geq Cn^{\beta}, n = 1,2, \ldots\]
In the coordinate plane consider the set $ S$ of all points with integer coordinates. For a positive integer $ k$, two distinct points $A$, $ B\in S$ will be called $ k$-[i]friends[/i] if there is a point $ C\in S$ such that the area of the triangle $ ABC$ is equal to $ k$. A set $ T\subset S$ will be called $ k$-[i]clique[/i] if every two points in $ T$ are $ k$-friends. Find the least positive integer $ k$ for which there exits a $ k$-clique with more than 200 elements.
[i]Proposed by Jorge Tipe, Peru[/i]
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_1, n_2$ be positive integers. Consider in a plane $E$ two disjoint sets of points $M_1$ and $M_2$ consisting of $2n_1$ and $2n_2$ points, respectively, and such that no three points of the union $M_1 \cup M_2$ are collinear. Prove that there exists a straightline $g$ with the following property: Each of the two half-planes determined by $g$ on $E$ ($g$ not being included in either) contains exactly half of the points of $M_1$ and exactly half of the points of $M_2.$
In a plane a set of $n\geq 3$ points is given. Each pair of points is connected by a segment. Let $d$ be the length of the longest of these segments. We define a diameter of the set to be any connecting segment of length $d$. Prove that the number of diameters of the given set is at most $n$.
Let $\,S\,$ be a finite set of points in three-dimensional space. Let $\,S_{x},\,S_{y},\,S_{z}\,$ be the sets consisting of the orthogonal projections of the points of $\,S\,$ onto the $yz$-plane, $zx$-plane, $xy$-plane, respectively. Prove that \[ \vert S\vert^{2}\leq \vert S_{x} \vert \cdot \vert S_{y} \vert \cdot \vert S_{z} \vert, \] where $\vert A \vert$ denotes the number of elements in the finite set $A$.
[hide="Note"] Note: The orthogonal projection of a point onto a plane is the foot of the perpendicular from that point to the plane. [/hide]
In the plane we are given a set $ E$ of 1991 points, and certain pairs of these points are joined with a path. We suppose that for every point of $ E,$ there exist at least 1593 other points of $ E$ to which it is joined by a path. Show that there exist six points of $ E$ every pair of which are joined by a path.
[i]Alternative version:[/i] Is it possible to find a set $ E$ of 1991 points in the plane and paths joining certain pairs of the points in $ E$ such that every point of $ E$ is joined with a path to at least 1592 other points of $ E,$ and in every subset of six points of $ E$ there exist at least two points that are not joined?
Can there be drawn on a circle of radius $1$ a number of $1975$ distinct points, so that the distance (measured on the chord) between any two points (from the considered points) is a rational number?
The $n$ points $P_1,P_2, \ldots, P_n$ are placed inside or on the boundary of a disk of radius 1 in such a way that the minimum distance $D_n$ between any two of these points has its largest possible value $D_n.$ Calculate $D_n$ for $n = 2$ to 7. and justify your answer.
A broken line $A_1A_2 \ldots A_n$ is drawn in a $50 \times 50$ square, so that the distance from any point of the square to the broken line is less than $1$. Prove that its total length is greater than $1248.$
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.
Prove that for every positive integer $m$ we can find a finite set $S$ of points in the plane, such that given any point $A$ of $S$, there are exactly $m$ points in $S$ at unit distance from $A$.
Let $E$ be a set of $n$ points in the plane $(n \geq 3)$ whose coordinates are integers such that any three points from $E$ are vertices of a nondegenerate triangle whose centroid doesnt have both coordinates integers. Determine the maximal $n.$
Let $ n$ and $ k$ be positive integers and let $ S$ be a set of $ n$ points in the plane such that
[b]i.)[/b] no three points of $ S$ are collinear, and
[b]ii.)[/b] for every point $ P$ of $ S$ there are at least $ k$ points of $ S$ equidistant from $ P.$
Prove that:
\[ k < \frac {1}{2} \plus{} \sqrt {2 \cdot n}
\]
$(HUN 3)$ In the plane $4000$ points are given such that each line passes through at most $2$ of these points. Prove that there exist $1000$ disjoint quadrilaterals in the plane with vertices at these points.
Let $\,S\,$ be a finite set of points in three-dimensional space. Let $\,S_{x},\,S_{y},\,S_{z}\,$ be the sets consisting of the orthogonal projections of the points of $\,S\,$ onto the $yz$-plane, $zx$-plane, $xy$-plane, respectively. Prove that \[ \vert S\vert^{2}\leq \vert S_{x} \vert \cdot \vert S_{y} \vert \cdot \vert S_{z} \vert, \] where $\vert A \vert$ denotes the number of elements in the finite set $A$.
[hide="Note"] Note: The orthogonal projection of a point onto a plane is the foot of the perpendicular from that point to the plane. [/hide]
Let $\Delta$ be a convex figure in a plane $\mathcal P$. Given a point $A\in\mathcal P$, to each pair $(M,N)$ of points in $\Delta$ we associate the point $m\in\mathcal P$ such that $\overrightarrow{Am}=\frac{\overrightarrow{MN}}2$ and denote by $\delta_A(\Delta)$ the set of all so obtained points $m$.
(a)
i. Prove that $\delta_A(\Delta)$ is centrally symmetric.
ii. Under which conditions is $\delta_A(\Delta)=\Delta$?
iii. Let $B,C$ be points in $\mathcal P$. Find a transformation which sends $\delta_B(\Delta)$ to $\delta_C(\Delta)$.
(b) Determine $\delta_A(\Delta)$ if
i. $\Delta$ is a set in the plane determined by two parallel lines.
ii. $\Delta$ is bounded by a triangle.
iii. $\Delta$ is a semi-disk.
(c) Prove that in the cases $b.2$ and $b.3$ the lengths of the boundaries of $\Delta$ and $\delta_A(\Delta)$ are equal.
Can there be drawn on a circle of radius $1$ a number of $1975$ distinct points, so that the distance (measured on the chord) between any two points (from the considered points) is a rational number?
A set of $1985$ points is distributed around the circumference of a circle and each of the points is marked with $1$ or $-1$. A point is called “good” if the partial sums that can be formed by starting at that point and proceeding around the circle for any distance in either direction are all strictly positive. Show that if the number of points marked with $-1$ is less than $662$, there must be at least one good point.
In a plane a set of $n\geq 3$ points is given. Each pair of points is connected by a segment. Let $d$ be the length of the longest of these segments. We define a diameter of the set to be any connecting segment of length $d$. Prove that the number of diameters of the given set is at most $n$.
Determine whether or nor there exist two disjoint infinite sets $ A$ and $ B$ of points in the plane satisfying the following conditions:
a.) No three points in $ A \cup B$ are collinear, and the distance between any two points in $ A \cup B$ is at least 1.
b.) There is a point of $ A$ in any triangle whose vertices are in $ B,$ and there is a point of $ B$ in any triangle whose vertices are in $ A.$
Let $A_0,A_1, \ldots , A_n$ be points in a plane such that
(i) $A_0A_1 \leq \frac{1}{ 2} A_1A_2 \leq \cdots \leq \frac{1}{2^{n-1} } A_{n-1}A_n$ and
(ii) $0 < \measuredangle A_0A_1A_2 < \measuredangle A_1A_2A_3 < \cdots < \measuredangle A_{n-2}A_{n-1}A_n < 180^\circ,$
where all these angles have the same orientation. Prove that the segments $A_kA_{k+1},A_mA_{m+1}$ do not intersect for each $k$ and $n$ such that $0 \leq k \leq m - 2 < n- 2.$
$A$ and $B$ are two points in the plane $\alpha$, and line $r$ passes through points $A, B$. There are $n$ distinct points $P_1, P_2, \ldots, P_n$ in one of the half-plane divided by line $r$. Prove that there are at least $\sqrt n$ distinct values among the distances $AP_1, AP_2, \ldots, AP_n, BP_1, BP_2, \ldots, BP_n.$
Consider in a plane $ P$ the points $ O,A_1,A_2,A_3,A_4$ such that \[ \sigma(OA_iA_j) \geq 1 \quad \forall i, j \equal{} 1, 2, 3, 4, i \neq j.\] where $ \sigma(OA_iA_j)$ is the area of triangle $ OA_iA_j.$ Prove that there exists at least one pair $ i_0, j_0 \in \{1, 2, 3, 4\}$ such that \[ \sigma(OA_iA_j) \geq \sqrt{2}.\]
Let $\{A_n | n = 1, 2, \cdots \} $ be a set of points in the plane such that for each $n$, the disk with center $A_n$ and radius $2^n$ contains no other point $A_j$ . For any given positive real numbers $a < b$ and $R$, show that there is a subset $G$ of the plane satisfying:
[b](i)[/b] the area of $G$ is greater than or equal to $R$;
[b](ii) [/b]for each point $P$ in $G$, $a < \sum_{n=1}^{\infty} \frac{1}{|A_nP|} <b.$