$ n > 2 $ points are chosen on a circle and each of them is connected to every other by a segment. Is it possible to draw all of these segments in one sequence, i.e. so that the end of the first segment is the beginning of the second, the end of the second - the beginning of the third, etc., and so that the end of the last segment is the beginning of the first?

In the plane there are $2020$ points, some of which are black and the rest are green. For every black point, the following applies: [i]There are exactly two green points that represent the distance $2020$ from that black point. [/i] Find the smallest possible number of green dots. (Walther Janous)

One hundred points are marked in the plane, with no three in a line. Is it always possible to connect the points in pairs such that all fifty segments intersect one another?

Let $n$ be a positive integer. Determine the minimum number of lines that can be drawn on the plane so that they intersect in exactly $n$ distinct points.

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

On the plane three different points $P, Q$, and $R$ are chosen. It is known that however one chooses another point $X$ on the plane, the point $P$ is always either closer to $X$ than the point $Q$ or closer to $X$ than the point $R$. Prove that the point $P$ lies on the line segment $QR$.

Let $a$ and $b$ be two positive integers satifying $gcd(a, b) = 1$. Consider a pawn standing on the grid point $(x, y)$. A step of type A consists of moving the pawn to one of the following grid points: $(x+a, y+a),(x+a,y-a), (x-a, y + a)$ or $(x - a, y - a)$. A step of type B consists of moving the pawn to $(x + b,y + b),(x + b,y - b), (x - b,y + b)$ or $(x - b,y - b)$. Now put a pawn on $(0, 0)$. You can make a (nite) number of steps, alternatingly of type A and type B, starting with a step of type A. You can make an even or odd number of steps, i.e., the last step could be of either type A or type B. Determine the set of all grid points $(x,y)$ that you can reach with such a series of steps.

Let $A_1,\ldots,A_n$ be different collinear points. Every point is dyed by one of four colors and every of these colors is used at least once. Show that there is a line segment where two colors are used exactly once and the other two are used at least once.

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.

Let $a$ and $b$ be two positive integers satifying $gcd(a, b) = 1$. Consider a pawn standing on the grid point $(x, y)$. A step of type A consists of moving the pawn to one of the following grid points: $(x+a, y+a),(x+a,y-a), (x-a, y + a)$ or $(x - a, y - a)$. A step of type B consists of moving the pawn to $(x + b,y + b),(x + b,y - b), (x - b,y + b)$ or $(x - b,y - b)$. Now put a pawn on $(0, 0)$. You can make a (nite) number of steps, alternatingly of type A and type B, starting with a step of type A. You can make an even or odd number of steps, i.e., the last step could be of either type A or type B. Determine the set of all grid points $(x,y)$ that you can reach with such a series of steps.

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.

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.

Mikko takes a multiple choice test with ten questions. His only goal is to pass the test, and this requires seven points. A correct answer is worth one point, and answering wrong results in the deduction of one point. Mikko knows for sure that he knows the correct answer in the six first questions. For the rest, he estimates that he can give the correct answer to each problem with probability $p, 0 < p < 1$. How many questions Mikko should try?

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.

Every point on a line is painted either red or blue. Prove that there always exist three points $A,B,C$ that are painted the same color and are such that the point $B$ is the midpoint of the segment $AC$.

Different points $A_1, A_2,..., A_n$ in the plane ($n> 3$) are such that the triangle $A_iA_jA_k$ is obtuse for all the different $i,j,k \in\{1,2,...,n\}$. Prove that there is a point $A_{n + 1}$ in the plane, such that the triangle $A_iA_jA_{n + 1}$ is obtuse for all different $i,j \in\{1,2,...,n\}$

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

The $n$ participants of a tournament are numbered with $0$ through $n - 1$. At the end of the tournament it turned out that for every team, numbered with $s$ and having $t$ points, there are exactly $t$ teams having $s$ points each. Determine all possibilities for the final score list.

Let eight points be given in a unit cube. Prove that two of these points are on a distance not greater than $1$.

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

We drew several straight lines on the plane and marked all of them intersection points. How many lines could be drawn? if one point is marked on one of the drawn lines, on the other - three, and on the third - five? Find all possible options and prove that there are no others.

Let $n$ points lie on the circle. Exactly half of triangles formed by these points are acute-angled. Find all possible $n$. (B.Frenkin)

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

Raquel painted $650$ points in a circle with a radius of $16$ cm. Shows that there is a circular crown with $2$ cm of inner radius and $3$ cm of outer radius that contain at least $10$ of these points.

Let $S = \{P_1,P_2,...,P_{2000}\}$ be a set of $2000$ points in the interior of a circle of radius $1$, one of which at its center. For $i = 1,2,...,2000$ denote by $x_i$ the distance from $P_i$ to the closest point $P_j \ne P_i$. Prove that $x_1^2 +x_2^2 +...+x_{2000}^2<9$ .