Found problems: 121
$37$ points are arbitrarily marked on the plane. Prove that among them there must be either two points at a distance greater than $6$, or two points at a distance less than $1.5$.
There are $1978$ points in the flat plane. Each point has a circular disk with that point as its center and the radius is the distance to a fixed point. Prove that there are five of these circular disks, which together cover all $1978$ points (circular disk means: the circle and its inner area).
$3n$ points are given ($n\ge 1$) in the plane, each $3$ of them are not collinear. Prove that there are $n$ distinct triangles with the vertices those points.
One hundred points are marked inside a circle, with no three in a line. Prove that it is possible to connect the points in pairs such that all fifty lines intersect one another inside the circle.
Let $n$ points lie on the circle. Exactly half of triangles formed by these points are acute-angled. Find all possible $n$.
(B.Frenkin)
Let eight points be given in a unit cube. Prove that two of these points are on a distance not greater than $1$.
On the plane painted $101$ points in brown and another $101$ points in green so that there are no three lying on one line. It turns out that the sum of the lengths of all $5050$ segments with brown ends equals the length of all $5050$ segments with green ends equal to $1$, and the sum of the lengths of all $10201$ segments with multicolored equals $400$. Prove that it is possible to draw a straight line so that all brown points are on one side relative to it and all green points are on the other.
Find all natural numbers $n$ for which there exists set $S$ consisting of $n$ points in the plane, satisfying the condition:
For each point $A \in S$ there exist at least three points say $X, Y, Z$ from $S$ such that the segments $AX, AY$ and$ AZ$ have length $1$ (it means that $AX = AY = AZ = 1$).
a) What is the least number of points that can be chosen on a circle of length $1956$, so that for each of these points there is exactly one chosen point at distance $1$, and exactly one chosen point at distance $2$ (distances are measured along the circle)?
b) On a circle of length $15$ there are selected $n$ points such that for each of them there is exactly one selected point at distance $1$ from it, and exactly one is selected point at distance $2$ from it. (All distances are measured along the circle.) Prove that $n$ is divisible by $10$.
On the plane are given $n > 2$ points, no three of which are collinear. Prove that among all closed polygonal lines passing through these points, any one with the minimum length is non-selfintersecting.
Given an integer $n \ge 3$. Find the largest positive integer $k $ with the following property:
For $n$ points in general position, there exists $k$ ways to draw a non-intersecting polygon with those $n$ points as it’s vertices.
[hide=Different wording]Given $n$, find the maximum $k$ so that for every general position of $n$ points , there are at least $k$ ways of connecting the points to form a polygon.[/hide]
On a plane, several points are chosen so that a disc of radius $1$ can cover every $3$ of them. Prove that a disc of radius $1$ can cover all the points.
Suppose $n$ straight lines are in the plane so that there exist seven points such that any of these line passes through at least three of these points. Find the largest possible value of $n$.
The radius $r$ of a circle with center at the origin is an odd integer.
There is a point ($p^m, q^n$) on the circle, with $p,q$ prime numbers and $m,n$ positive integers.
Determine $r$.
Show that no matter how $15$ points are plotted within a circle of radius $2$ (circle border included), there will be a circle with radius $1$ (circle border including) which contains at least three of the $15$ points.
There are $n$ points in a plane. Prove that there exist a point $O$ (not necessarily from the given $n$) such that on each side of an arbitrary line, through $O$, lie at least $\frac{n}{3}$ points (including the points on the line).
Let $n$ be a non-zero natural number, $n \ge 5$. Consider $n$ distinct points in the plane, each colored or white, or black. For each natural $k$ , a move of type $k, 1 \le k <\frac {n} {2}$, means selecting exactly $k$ points and changing their color. Determine the values of $n$ for which, whatever $k$ and regardless of the initial coloring, there is a finite sequence of $k$ type moves, at the end of which all points have the same color.
There are $n \ge 2$ points in a square side $1$. Show that one can label the points $P_1, P_2, ... , P_n$ such that $\sum_{i=1}^n |P_{i-1} - P_i|^2 \le 4$, where we use cyclic subscripts, so that $P_0$ means $P_n$.
Let $n$ be a positive integer. A square $ABCD$ is divided into $n^2$ identical small squares by drawing $(n-1)$ equally spaced lines parallel to the side $AB$ and another $(n- 1)$ equally spaced lines parallel to $BC$, thus giving rise to $(n+1)^2$ intersection points. The points $A, C$ are coloured red and the points $B, D$ are coloured blue. The rest of the intersection points are coloured either red or blue. Prove that the number of small squares having exactly $3$ vertices of the same colour is even.
On a circle, distinct points $A_1, ... , A_{16}$ are chosen. Consider all possible convex polygons all of whose vertices are among $A_1, ... , A_{16}$ . These polygons are divided into $2$ groups, the first group comprising all polygons with $A_1$ as a vertex, the second group comprising the remaining polygons. Which group is more numerous?
Each point in space is colored in one of four different colors. Prove that there is a segment $1$ cm long with endpoints of the same color.