$3n-1$ points are given in the plane, no three are collinear. Prove that one can select $2n$ of them whose convex hull is not a triangle.

Let $S$ be a square with sides length $100$. Let $L$ be a path within $S$ which does not meet itself and which is composed of line segments $A_0A_1,A_1A_2,A_2A_3,\ldots,A_{n-1}A_n$ with $A_0=A_n$. Suppose that for every point $P$ on the boundary of $S$ there is a point of $L$ at a distance from $P$ no greater than $\frac {1} {2}$. Prove that there are two points $X$ and $Y$ of $L$ such that the distance between $X$ and $Y$ is not greater than $1$ and the length of the part of $L$ which lies between $X$ and $Y$ is not smaller than $198$.

In a field, $2023$ friends are standing in such a way that all distances between them are distinct. Each of them fires a water pistol at the friend that stands closest. Prove that at least one person does not get wet.

Each face of a cube is of the same size as each square of a chessboard. The cube is coloured black and white, placed on one of the squares of the chessboard and rolled so that each square of the chessboard is visited exactly once. Can this be done in such a way that the colour of the visited square and the colour of the bottom face of the cube are always the same? (A Shapovalov)

Let $O$ be a fixed point in the plane. We have $2024$ red points, $2024$ yellow points and $2024$ green points in the plane, where there isn't any three colinear points and all points are distinct from $O$. It is known that for any two colors, the convex hull of the points that are from any of those two colors contains $O$ (it maybe contain it in it's interior or in a side of it). We say that a red point, a yellow point and a green point make a [i]bolivian[/i] triangle if said triangle contains $O$ in its interior or in one of its sides. Determine the greatest positive integer $k$ such that, no matter how such points are located, there is always at least $k$ [i]bolivian[/i] triangles.

The convex quadrilaterals $ABCD$ and $PQRS$ are made respectively from paper and cardboard. We say that they suit each other if the following two conditions are met : ( 1 ) It is possible to put the cardboard quadrilateral on the paper one so that the vertices of the first lie on the sides of the second, one vertex per side, and (2) If, after this, we can fold the four non-covered triangles of the paper quadrilateral on to the cardboard one, covering it exactly. ( a) Prove that if the quadrilaterals suit each other, then the paper one has either a pair of opposite sides parallel or (a pair of) perpendicular diagonals. (b) Prove that if $ABCD$ is a parallelogram, then one can always make a cardboard quadrilateral to suit it. (N. Vasiliev)

The target is a triangle divided by three families of parallel lines into $100$ equal regular triangles with single sides. A sniper shoots at a target. He aims at triangle and hits either it or one of the sides adjacent to it. He sees the results of his shooting and can choose when stop shooting. What is the greatest number of triangles he can with a guarantee of hitting five times?

In the $43$ dimension Euclidean space the convex hull of finite set $S$ contains polyhedron $P$. We know that $P$ has $47$ vertices. Prove that it is possible to choose at most $2021$ points in $S$ such that the convex hull of these points also contain $P$, and this is sharp.

Given several squares with the total area $1$. Prove that you can pose them in the square of the area $2$ without any intersections.

Two polygons are cut from the cardboard. Is it possible that for any disposition of these polygons on the plane they have either common inner points or only a finite number of common points on the boundary?

$n$ points are marked on the board points that are vertices of the regular $n$ -gon. One of the points is a chip. Two players take turns moving it to the other marked point and at the same time draw a segment that connects them. If two points already connected by a segment, such a move is prohibited. A player who can't make a move, lose. Which of the players can guarantee victory?

Consider $120$ unit squares arbitrarily situated in a $20\times 25$ rectangle. Prove that one can place a circle with unit diameter in the rectangle without intersecting any of the squares.

The plane is divided by three infinite sets of parallel lines into equilateral triangles of equal area. Let $M$ be the set of their vertices, and $A$ and $B$ be two vertices of such an equilateral triangle. One may rotate the plane through $120^o$ around any vertex of the set $M$. Is it possible to move the point $A$ to the point $B$ by a number of such rotations (N Vasiliev, Moscow)

Find the greatest possible number of lines in space that all pass through a single point and the angle between any two of them is the same.

A rectangular grid of streets has $m$ north-south streets and $n$ east-west streets. For which $m, n > 1$ is it possible to start at an intersection and drive through each of the other intersections just once before returning to the start?

The points of space are coloured with five colours, with all colours being used. Prove that some plane contains four points of different colours.

Several circles are drawn on the plane and all points of their meeting or touching are marked. May be that each circle contains exactly four marked points and exactly four marked points lie on each circle?

There are $2015$ distinct circles in a plane, with radius $1$. Prove that you can select $27$ circles, which form a set $C$, which satisfy the following. For two arbitrary circles in $C$, they intersect with each other or For two arbitrary circles in $C$, they don't intersect with each other.

The plane is divided into domains by $ n$ straight lines in general position, where $ n \geq 3$. Determine the maximum and minimum possible number of angular domains among them. (We say that $ n$ lines are in general position if no two are parallel and no three are concurrent.)

The plan of the castle in Baranow Sandomierski can be presented as the graph with $16$ vertices on the picture. A night guard plans a closed round along the edges of this graph. (a) How many rounds passing through each vertex exactly once are there? The directions are irrelevant. (b) How many non-selfintersecting rounds (taking directions into account) containing each edge of the graph exactly once are there? [img]https://cdn.artofproblemsolving.com/attachments/1/f/27ca05fc689fd8d873130db9d8cc52acf49bb4.png[/img]

Let $n$ be a positive integer and let $0\leq k\leq n$ be an integer. Show that there exist $n$ points in the plane with no three on a line such that the points can be divided into two groups satisfying the following properties. $\text{(i)}$ The first group has $k$ points and the distance between any two distinct points in this group is irrational. $\text{(ii)}$ The second group has $n-k$ points and the distance between any two distinct points in this group is an integer. $\text{(iii)}$ The distance between a point in the first group and a point in the second group is irrational.

Given is a regular $n$-gon with circumradius $1$. $L$ is the set of (different) lengths of all connecting segments of its endpoints. What is the sum of the squares of the elements of $L$?

Define a regular $n$-pointed star to be a union of $n$ lines segments $P_1P_2, P_2P_3, ..., P_nP_1$ such that $\bullet$ the points $P_1,P_2,...,P_n$ are coplanar and no three of them are collinear, $\bullet$ each of the $n$ line segments intersects at least one of the other line segments at a point other than an endpoint, $\bullet$ all of the angles at $P_1, P_2,..., P_n$ are congruent , $\bullet$ all of the $n$ line segments $P_1P_2, P_2P_3, ..., P_nP_1$ are congruent, and $\bullet$ the path $P_1P_2...P_nP_1$ turns counterclockwise at an angle less than $180^o$ at each vertex. There are no regular $3$-pointed, $4$-pointed, or $6$-pointed stars. All regular $5$-pointed star are similar, but there are two non-similar regular $7$-pointed stars. Find all possible values of $n$ such that there are exactly $29$ non-similar regular $n$-pointed stars.

In space are given $n$ segments $A_iB_i$ and a point $O$ not lying on any segment, such that the sum of the angles $A_iOB_i$ is less than $180^o$ . Prove that there exists a plane passing through $O$ and not intersecting any of the segments.

Given a finite set of polygons in the plane. Every two of them have a common point. Prove that there exists a straight line, that crosses all the polygons.