Prove that a convex polygon can be cut by disjoint diagonals into acute triangles in at least one way.

A configuration of $4027$ points in the plane is called Colombian if it consists of $2013$ red points and $2014$ blue points, and no three of the points of the configuration are collinear. By drawing some lines, the plane is divided into several regions. An arrangement of lines is good for a Colombian configuration if the following two conditions are satisfied: i) No line passes through any point of the configuration. ii) No region contains points of both colors. Find the least value of $k$ such that for any Colombian configuration of $4027$ points, there is a good arrangement of $k$ lines. Proposed by [i]Ivan Guo[/i] from [i]Australia.[/i]

Given a set $n$ of points in the plane that are not contained in a single straight line. Prove that there exists a circle passing through at least three of these points, inside which there are none of the remaining points of the set.

For each finite set $ U$ of nonzero vectors in the plane we define $ l(U)$ to be the length of the vector that is the sum of all vectors in $ U.$ Given a finite set $ V$ of nonzero vectors in the plane, a subset $ B$ of $ V$ is said to be maximal if $ l(B)$ is greater than or equal to $ l(A)$ for each nonempty subset $ A$ of $ V.$ (a) Construct sets of 4 and 5 vectors that have 8 and 10 maximal subsets respectively. (b) Show that, for any set $ V$ consisting of $ n \geq 1$ vectors the number of maximal subsets is less than or equal to $ 2n.$

Each grid point of a cartesian plane is colored with one of three colors, whereby all three colors are used. Show that one can always find a right-angled triangle, whose three vertices have pairwise different colors.

A rectangular board, where in each square there is a symbol, is said to be [i]magnificent [/i] if, for each line$ L$ and for each pair of columns $C$ and $D$, there is on the board another line $M$ exactly equal to $L$, except in columns $C$ and $D$, where $M$ has symbols different from those of $L$. What is the smallest possible number of rows on a magnificent board with $2023$ columns?

A rectangle is dissected into several smaller rectangles. Is it possible that for each pair of these rectangles, the line segment connecting their centers intersects some third rectangle?

The plane is cut up into equilateral triangles by three families of parallel lines. Is it possible to find $4$ vertices of these triangles which form a square?

Determine the greatest number of figures congruent to [img]https://cdn.artofproblemsolving.com/attachments/c/6/343f9197bcebf6794460ed1a74ba83ec18a377.png[/img] that can be placed in a $9 \times 9$ grid (without overlapping), such that each figure covers exactly $4$ unit squares. The figures can be rotated and flipped over. For example, the picture below shows that at least $3$ such figures can be placed in a $4 \times4$ grid. [img]https://cdn.artofproblemsolving.com/attachments/1/e/d38fc34b650a1333742bb206c29985c94146aa.png[/img]

Prove the following theorem: If there are $n$ pairs of different points $P_i$, $i = 1, 2, ..., n$, $n > 2$ in three dimensions space, such that each of them is at a smaller distance from one and the same point $Q$ than any other $P_i$, then $n < 15$.

Let $n_1, n_2$ be positive integers. Consider in a plane $E$ two disjoint sets of points $M_1$ and $M_2$ consisting of $2n_1$ and $2n_2$ points, respectively, and such that no three points of the union $M_1 \cup M_2$ are collinear. Prove that there exists a straightline $g$ with the following property: Each of the two half-planes determined by $g$ on $E$ ($g$ not being included in either) contains exactly half of the points of $M_1$ and exactly half of the points of $M_2.$

Determine all bounded closed subsets $F$ of the plane with the following property: $F$ consists of at least two points and always contains two points $A$ and $B$ as well as at least one of the two semicircular arcs over the segment $AB$. Definitions: A subset of the $F$ of the plane is said to be closed if: For every point $P$ of the plane that is not an element of $F$ , there is a (non-degenerate) disc with center $P$ that has no elements of $F$.

You are given some equilateral triangles and squares, all with side length 1, and asked to form convex $n$ sided polygons using these pieces. If both types must be used, what are the possible values of $n$, assuming that there is sufficient supply of the pieces?

A polygon is decomposed into triangles by drawing some non-intersecting interior diagonals in such a way that for every pair of triangles of the triangulation sharing a common side, the sum of the angles opposite to this common side is greater than $180^o$. a) Prove that this polygon is convex. b) Prove that the circumcircle of every triangle used in the decomposition contains the entire polygon. [i]Proposed by Morteza Saghafian - Iran[/i]

On a plane with a fixed coordinate system, there is a convex polygon whose all vertices have integer coordinates. Prove that twice the area of this polygon is an integer.

On the plane with a rectangular coordinate system, a set of infinitely many rectangles is given. Every rectangle has the origin as one of its vertices. The sides of all rectangles are parallel to the coordinate axes, and all sides have integer lengths. Prove that there are at least two rectangles in the set, one of which completely covers the other.

Given seven points on a plane, with no three points collinear. Prove that it is always possible to divide these points into the vertices of a triangle and a convex quadrilateral, with no shared parts between the two shapes.

A convex set $S$ on a plane, not lying on a line, is painted in $p$ colors. Prove that for every $n \ge 3$ there exist infinitely many congruent $n$-gons whose vertices are of the same color.

Suppose two polygons may be glued together at an edge if and only if corresponding edges of the same length are made to coincide. A $3\times 4$ rectangle is cut into $n$ pieces by making straight line cuts. What is the minimum value of $n$ so that it’s possible to cut the pieces in such a way that they may be glued together two at a time into a polygon with perimeter at least $2021$?

Given convex $1000$-gon. Inside this polygon, $1020$ points are chosen so that no $3$ of the $2020$ points do not lie on one line. Polygon is cut into triangles so that these triangles have vertices only those specified $2020$ points and each of these points is the vertex of at least one of cutting triangles. How many such triangles were formed?

Let $n>1$ be an integer. Suppose we are given $2n$ points in the plane such that no three of them are collinear. The points are to be labelled $A_1, A_2, \dots , A_{2n}$ in some order. We then consider the $2n$ angles $\angle A_1A_2A_3, \angle A_2A_3A_4, \dots , \angle A_{2n-2}A_{2n-1}A_{2n}, \angle A_{2n-1}A_{2n}A_1, \angle A_{2n}A_1A_2$. We measure each angle in the way that gives the smallest positive value (i.e. between $0^{\circ}$ and $180^{\circ}$). Prove that there exists an ordering of the given points such that the resulting $2n$ angles can be separated into two groups with the sum of one group of angles equal to the sum of the other group.

An equilateral triangle with side 101 is placed on a plane so that one of its sides is horizontal and the triangle is above it. It is divided into smaller equilateral triangles with side 1 by segments parallel to its sides. All sides of these smaller triangles are colored red (including the entire border of the large triangle). An equilateral triangle on a plane is called a "mirror" triangle if its sides are parallel to the sides of the original triangle, but it lies below its horizontal side. What is the smallest number of contours of mirror triangles needed to cover all the red segments? (Mirror triangles may overlap and extend beyond the original triangle.) [i]Proposed by Dmitry Shiryayev[/i]

A plane is divided into $N$ regions by three families of parallel lines. No three lines pass through the same point. What is the smallest number of lines needed so that $N > 1999$?

From an $n\times n$ square divided into $n^2$ unit squares, one corner unit square is cut off. Find all positive integers $n$ for which it is possible to tile the remaining part of the square with $L$-trominos. [img]https://cdn.artofproblemsolving.com/attachments/0/4/d13e6e7016d943b867f44375a2205b10ccf552.png[/img]

From the vertices of a regular 27-gon, seven are chosen arbitrarily. Prove that among these seven points there are three points that form an isosceles triangle or four points that form an isosceles trapezoid.