Found problems: 121
Mark $4 \cdot k$ points in a circle and number them arbitrarily with numbers from $1$ to $4 \cdot k$. The chords cannot share common endpoints, also, the endpoints of these chords should be among the $4 \cdot k$ points.
[b]i.[/b] Prove that $2 \cdot k$ pairwisely non-intersecting chords can be drawn for each of whom its endpoints differ in at most $3 \cdot k - 1$.
[b]ii.[/b] Prove that the $3 \cdot k - 1$ cannot be improved.
$2015$ points are given in a plane such that from any five points we can choose two points with distance less than $1$ unit. Prove that $504$ of the given points lie on a unit disc.
$64$ distinct points are positioned in the plane so that they determine exactly $2003$ different lines. Prove that among the $64$ points there are at least $4$ collinear points.
Mark $4 \cdot k$ points in a circle and number them arbitrarily with numbers from $1$ to $4 \cdot k$. The chords cannot share common endpoints, also, the endpoints of these chords should be among the $4 \cdot k$ points.
[b]i.[/b] Prove that $2 \cdot k$ pairwisely non-intersecting chords can be drawn for each of whom its endpoints differ in at most $3 \cdot k - 1$.
[b]ii.[/b] Prove that the $3 \cdot k - 1$ cannot be improved.
Three colors are available to paint the plane. If each point in the plane is assigned one of these three colors, prove that there is a segment of length $1$ whose endpoints have the same color.
Given $3n$ points in the plane, no three collinear, is it always possible to form $n$ triangles (with vertices at the points), so that no point in the plane lies in more than one triangle?
Let $k$ be a positive integer. Find all positive integers $n$, such that it is possible to mark $n$ points on the sides of a triangle (different from its vertices) and connect some of them with a line in such a way that the following conditions are satisfied:
1) there is at least $1$ marked point on each side,
2) for each pair of points $X$ and $Y$ marked on different sides, on the third side there exist exactly $k$ marked points which are connected to both $X$ and $Y$ and exactly k points which are connected to neither $X$ nor $Y$
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.
Consider $5$ points in the plane, such that there are no $3$ of them collinear. Prove that there is a convex quadrilateral with vertices at $4$ points.
Prove that from any five points in the plane it is possible to choose three points that are not vertices of an acute triangle.
What greatest number of triples of points can be selected from $1955$ given points, so that each two triples have one common point?
There are two points $A$ and $B$ in the plane.
a) Determine the set $M$ of all points $C$ in the plane for which $|AC|^2 +|BC|^2 = 2\cdot|AB|^2.$
b) Decide whether there is a point $C\in M$ such that $\angle ACB$ is maximal and if so, determine this angle.
$16$ chess players held a tournament among themselves: every two chess players played exactly one game. For victory in the party was given $1$ point, for a draw $0.5$ points, for defeat $0$ points. It turned out that exactly 15 chess players shared the first place. How many points could the sixteenth chess player score?
Prove that there are $2012$ points in the plane, none of which are three on one straight line and in pairs have integer distances .
$101$ blue and $101$ red points are selected on the plane, and no three lie on one straight line. The sum of the pairwise distances between the red points is $1$ (that is, the sum of the lengths of the segments with ends at red points), the sum of the pairwise distances between the blue ones is also $1$, and the sum of the lengths of the segments with the ends of different colors is $400$. Prove that you can draw a straight line separating everything red dots from all blue ones.
$1994$ points from the plane are given so that any $100$ of them can be selected $98$ that can be rounded (some points may be at the border of the circle) with a diameter of $1$. Determine the smallest number of circles with radius $1$, sufficient to cover all $1994$
Given any four distinct points in the plane, show that the ratio of the largest to the smallest distance between two of them is at least $\sqrt2$.
A circle is divided into $n$ equal arcs by $n$ points. Assume that, no matter how we color the $n$ points in two colors, there always exists an axis of symmetry of the set of points such that any two of the $n$ points which are symmetric with respect to that axis have the same color. Find all possible values of $n$.
Let $n$ red and $n$ blue subarcs of a circle be given such that each red subarc intersects each blue subarc. Prove that there is a point which is covered by at least $n$ of the given (red or blue) subarcs.
Let $k$ be a fixed positive integer. For each $n = 1, 2,...,$ we will call [i]configuration [/i] of order $n$ any set of $kn$ points of the plane, which does not contain $3$ collinear, colored with $k$ given colors, so that there are $n$ points of each color. Determine all positive integers $n$ with the following property: in each configuration of order $n$, it is possible to select three points of each color, such that the $k$ triangles with vertices of the same color that are determined are disjoint in pairs.
$101$ blue and $101$ red points are selected on the plane, and no three lie on one straight line. The sum of the pairwise distances between the red points is $1$ (that is, the sum of the lengths of the segments with ends at red points), the sum of the pairwise distances between the blue ones is also $1$, and the sum of the lengths of the segments with the ends of different colors is $400$. Prove that you can draw a straight line separating everything red dots from all blue ones.
$N> 4$ points move around the circle, each with a constant speed. For Any four of them have a moment in time when they all meet. Prove that is the moment when all the points meet.
Show that one can color all the points of a plane using only two colors such that no line segment has all points of the same color.
Consider six points in the interior of a square of side length $3$.
Prove that among the six points, there are two whose distance is less than $2$.
The set $M$ consists of $n$ points on the plane and satisfies the conditions:
$\bullet$ there are $7$ points in the set $M$, which are vertices of a convex heptagon,
$\bullet$ for arbitrary five points with $M$, which are vertices of a convex pentagon, there is a point that also belongs to $M$ and lies inside this pentagon.
Find the smallest possible value that $n$ can take .