Find the smallest real $\alpha$, such that for any convex polygon $P$ with area $1$, there exist a point $M$ in the plane, such that the area of convex hull of $P\cup Q$ is at most $\alpha$, where $Q$ denotes the image of $P$ under central symmetry with respect to $M$.

What is the least positive integer $k$ such that, in every convex $101$-gon, the sum of any $k$ diagonals is greater than or equal to the sum of the remaining diagonals?

A [i]slab[/i] is the set of points strictly between two parallel planes. Prove that a countable sequence of slabs, the sum of whose thicknesses converges, cannot fill space.

A regular $1997$-gon is divided into triangles by non-intersecting diagonals. Prove that exactly one of them is acute-angled.

Initially, the point-like particles $A, B$ and $C{}$ are located respectively at the points $(0,0), (1,0)$ and $(0,1)$ in the coordinate plane. Every minute some two particles repel each other along the straight line connecting their current positions, moving the same (positive) distance. [list=a] [*]Can the particle $A{}$ be at the point $(3,3)$? What about the point $(2,3)$? [*]Can the particles $B{}$ and $C{}$ be at the same time at the points $(0,100)$ and $(100,0)$ respectively? [/list] [i]Proposed by K. Krivosheev[/i]

There are several triangles. From them a new triangle is obtained according to the following rule. The largest side of the new triangle is equal to the sum of the large sides of the data, the middle one is equal to the sum of the middle sides, and the smallest one is the sum of the smaller ones. Prove that if all the angles of these triangles were less than $a$, and $\phi$, where $\phi$ is the largest angle of the resulting triangle, then $\cos \phi \ge 1-\sin (a/2)$.

On the plane is give a broken line $ABCD$ in which $AB = BC = CD = 1$, and $AD$ is not equal to $1$. The positions of $B$ and $C$ are fixed but $A$ and $D$ change their positions in turn according to the following rule (preserving the distance rules given): the point $A$ is reflected with respect to the line $BD$, then $D$ is reflected with respect to the line $AC$ (in which $A$ occupies its new position), then $A$ is reflected with respect to the line $BD$ ($D$ occupying its new position), $D$ is reflected with respect to the line $AC$, and so on. Prove that after several steps $A$ and $D$ coincide with their initial positions. (M Kontzewich)

Determine all integers $ n > 3$ for which there exist $ n$ points $ A_{1},\cdots ,A_{n}$ in the plane, no three collinear, and real numbers $ r_{1},\cdots ,r_{n}$ such that for $ 1\leq i < j < k\leq n$, the area of $ \triangle A_{i}A_{j}A_{k}$ is $ r_{i} \plus{} r_{j} \plus{} r_{k}$.

Given $n>3$ points in the plane such that no three of the points are collinear. Does there exist a circle passing through (at least) $3$ of the given points and not containing any other of the $n$ points in its interior ?

A plane has a special point $O$ called the origin. Let $P$ be a set of 2021 points in the plane such that [list] [*] no three points in $P$ lie on a line and [*] no two points in $P$ lie on a line through the origin. [/list] A triangle with vertices in $P$ is [i]fat[/i] if $O$ is strictly inside the triangle. Find the maximum number of fat triangles.

Let $m,n,k$ be pairwise relatively prime positive integers greater than $3$. Find the minimal possible number of points on the plane with the following property: there are $x$ of them which are the vertices of a regular $x$-gon for $x = m, x = n, x = k$. (E.Piryutko)

To obtain a square $P$ of side length $2$ cm divided into $4$ unit squares it is sufficient to draw $3$ squares: $P$ and another $2$ unit squares with a common vertex, as shown below: [img]https://cdn.artofproblemsolving.com/attachments/1/d/827516518871ec8ff00a66424f06fda9812193.png[/img] Find the minimum number of squares sufficient to obtain a square.of side length $n$ cm divided into $n^2$ unit squares ($n \ge 3$ is an integer).

Find all natural numbers $n$ for which there exists a convex polyhedron with $n$ edges, with exactly one vertex having four edges and all other vertices having $3$ edges.

Six points are given so that there are not three on the same line and that the lengths of the segments determined by these points are all different. We consider all the triangles that they have their vertices at these points. Show that there is a segment that is both the shortest side of one of those triangles and the longest side of another.

Three triangles (blue, green and red) have a common interior point $M$. Prove that it is possible to choose one vertex from each triangle so that point $M$ is located inside the triangle formed by these selected vertices. (Imre Barani, Hungary)

Given a convex pentagon $ABCDE$, prove that if an arbitrary point $M$ inside the pentagon is connected by lines with all the pentagon’s vertices, then either one or three or five of these lines cross the sides of the pentagon opposite the vertices they pass. Note: In reality, we need to exclude the points of the diagonals, because that in this case the drawn lines can pass not through the internal points of the sides, but through the vertices. But if the drawn diagonals are not considered or counted twice (because they are drawn from two vertices), then the statement remains true.

Let $m$ be a convex polygon in a plane, $l$ its perimeter and $S$ its area. Let $M\left( R\right) $ be the locus of all points in the space whose distance to $m$ is $\leq R,$ and $V\left(R\right) $ is the volume of the solid $M\left( R\right) .$ [i]a.)[/i] Prove that \[V (R) = \frac 43 \pi R^3 +\frac{\pi}{2} lR^2 +2SR.\] Hereby, we say that the distance of a point $C$ to a figure $m$ is $\leq R$ if there exists a point $D$ of the figure $m$ such that the distance $CD$ is $\leq R.$ (This point $D$ may lie on the boundary of the figure $m$ and inside the figure.) additional question: [i]b.)[/i] Find the area of the planar $R$-neighborhood of a convex or non-convex polygon $m.$ [i]c.)[/i] Find the volume of the $R$-neighborhood of a convex polyhedron, e. g. of a cube or of a tetrahedron. [b]Note by Darij:[/b] I guess that the ''$R$-neighborhood'' of a figure is defined as the locus of all points whose distance to the figure is $\leq R.$

An ant walks on the plane as follows: initially, it walks $1$ cm in any direction. After, at each step, it changes the trajectory direction by $60^o$ left or right and walks $1$ cm in that direction. It is possible that it returns to the point from which it started in (a) $2008$ steps? (b) $2009$ steps? [img]https://cdn.artofproblemsolving.com/attachments/8/b/d4c0d03c67432c4e790b465a74a876b938244c.png[/img]

a) * In a rectangle of area $5$ sq. units, $9$ rectangles of area $1$ are arranged. Prove that the area of the overlap of some two of these rectangles is $\ge 1/9$ b) In a rectangle of area $5$ sq. units, lie $9$ arbitrary polygons each of area $1$. Prove that the area of the overlap of some two of these rectangles is $\ge 1/9$

There are three polygons and the area of each one is $3$. They are drawn inside a square of area $6$. Find the greatest value of $m$ such that among those three polygons, we can always find two polygons so that the area of their overlap is not less than $m$.

A museum has the shape of a (not necessarily convex) 3$n$-gon. Prove that $n$ custodians can be positioned so as to control all of the museum’s space.

We are given tiles in the form of right angled triangles having perpendicular sides of length $1$ cm and $2$ cm. Is it possible to form a square from $20$ such tiles? ( S . Fomin , Leningrad)

Let $ S$ be a set of $ 6n$ points in a line. Choose randomly $ 4n$ of these points and paint them blue; the other $ 2n$ points are painted green. Prove that there exists a line segment that contains exactly $ 3n$ points from $ S$, $ 2n$ of them blue and $ n$ of them green.

A convex polygon on a plane contains at least $m^2+1$ points with integer coordinates. Prove that it contains $m+1$ points with integer coordinates that lie on the same line.

There are $16$ points marked on the circle. Find the greatest possible number of acute triangles with vertices at the marked points.