Found problems: 85
Determine all integers $ n > 3$ for which there exist $ n$ points $ A_{1},\cdots ,A_{n}$ in the plane, no three collinear, and real numbers $ r_{1},\cdots ,r_{n}$ such that for $ 1\leq i < j < k\leq n$, the area of $ \triangle A_{i}A_{j}A_{k}$ is $ r_{i} \plus{} r_{j} \plus{} r_{k}$.
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.
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 $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 \]
Ten points are marked in the plane so that no three of them lie on a line. Each pair of points is connected with a segment. Each of these segments is painted with one of $k$ colors, in such a way that for any $k$ of the ten points, there are $k$ segments each joining two of them and no two being painted with the same color. Determine all integers $k$, $1\leq k\leq 10$, for which this is possible.
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.$
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.
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 $\,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]