$(USS 5)$ Given $5$ points in the plane, no three of which are collinear, prove that we can choose $4$ points among them that form a convex quadrilateral.

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.

$25$ point in a plane and for all $3$ points, we find $2$ points such that this $2$ points' distance less than $1$ $cm$ . Prove that at least $13$ points in a circle of radius $1$ $cm$.

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} \]

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} \]

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

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]

Find maximal numbers of planes, such there are $6$ points and 1) $4$ or more points lies on every plane. 2) No one line passes through $4$ points.

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 $f(n)$ be the least number of distinct points in the plane such that for each $k = 1, 2, \cdots, n$ there exists a straight line containing exactly $k$ of these points. Find an explicit expression for $f(n).$ [i]Simplified version.[/i] Show that $f(n)=\left[\frac{n+1}{2}\right]\left[\frac{n+2}{2}\right].$ Where $[x]$ denoting the greatest integer not exceeding $x.$

$(SWE 3)$ Find the natural number $n$ with the following properties: $(1)$ Let $S = \{P_1, P_2, \cdots\}$ be an arbitrary finite set of points in the plane, and $r_j$ the distance from $P_j$ to the origin $O.$ We assign to each $P_j$ the closed disk $D_j$ with center $P_j$ and radius $r_j$. Then some $n$ of these disks contain all points of $S.$ $(2)$ $n$ is the smallest integer with the above property.

In the space $n \geq 3$ points are given. Every pair of points determines some distance. Suppose all distances are different. Connect every point with the nearest point. Prove that it is impossible to obtain (closed) polygonal line in such a way.

Let $\mathcal{S}$ be a finite set of at least two points in the plane. Assume that no three points of $\mathcal S$ are collinear. A [i]windmill[/i] is a process that starts with a line $\ell$ going through a single point $P \in \mathcal S$. The line rotates clockwise about the [i]pivot[/i] $P$ until the first time that the line meets some other point belonging to $\mathcal S$. This point, $Q$, takes over as the new pivot, and the line now rotates clockwise about $Q$, until it next meets a point of $\mathcal S$. This process continues indefinitely. Show that we can choose a point $P$ in $\mathcal S$ and a line $\ell$ going through $P$ such that the resulting windmill uses each point of $\mathcal S$ as a pivot infinitely many times. [i]Proposed by Geoffrey Smith, United Kingdom[/i]

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

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 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 $n$ be a natural number greater than 2. $l$ is a line on a plane. There are $n$ distinct points $P_1$, $P_2$, …, $P_n$ on $l$. Let the product of distances between $P_i$ and the other $n-1$ points be $d_i$ ($i = 1, 2,$ …, $n$). There exists a point $Q$, which does not lie on $l$, on the plane. Let the distance from $Q$ to $P_i$ be $C_i$ ($i = 1, 2,$ …, $n$). Find $S_n = \sum_{i = 1}^{n} (-1)^{n-i} \frac{c_i^2}{d_i}$.

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

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]

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.

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

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 $P_1, P_2, \dots , P_n$ be distinct points of the plane, $n \geq 2$. Prove that \[ \max_{1\leq i<j\leq n} P_iP_j > \frac{\sqrt 3}{2}(\sqrt n -1) \min_{1\leq i<j\leq n} P_iP_j \]

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\]