A sleeping rabbit lies in the interior of a convex $2024$-gon. A hunter picks three vertices of the polygon and he lays a trap which covers the interior and the boundary of the triangular region determined by them. Determine the minimum number of times he needs to do this to guarantee that the rabbit will be trapped. [i]Proposed by Anant Mudgal and Rohan Goyal[/i]

A set of identical square tiles with side length $1$ is placed on a (very large) floor. Every tile after the first shares an entire edge with at least one tile that has already been placed. - What is the largest possible perimeter for a figure made of $10$ tiles? - What is the smallest possible perimeter for a figure made of $10$ tiles? - What is the largest possible perimeter for a figure made of $2011$ tiles? - What is the smallest possible perimeter for a figure made of $2011$ tiles? Prove that your answers are correct.

Daniel chooses a positive integer $n$ and tells Ana. With this information, Ana chooses a positive integer $k$ and tells Daniel. Daniel draws $n$ circles on a piece of paper and chooses $k$ different points on the condition that each of them belongs to one of the circles he drew. Then he deletes the circles, and only the $k$ points marked are visible. From these points, Ana must reconstruct at least one of the circumferences that Daniel drew. Determine which is the lowest value of $k$ that allows Ana to achieve her goal regardless of how Daniel chose the $n$ circumferences and the $k$ points.

Consider a regular 2n-gon $ P$,$A_1,A_2,\cdots ,A_{2n}$ in the plane ,where $n$ is a positive integer . We say that a point $S$ on one of the sides of $P$ can be seen from a point $E$ that is external to $P$ , if the line segment $SE$ contains no other points that lie on the sides of $P$ except $S$ .We color the sides of $P$ in 3 different colors (ignore the vertices of $P$,we consider them colorless), such that every side is colored in exactly one color, and each color is used at least once . Moreover ,from every point in the plane external to $P$ , points of most 2 different colors on $P$ can be seen .Find the number of distinct such colorings of $P$ (two colorings are considered distinct if at least one of sides is colored differently). [i]Proposed by Viktor Simjanoski, Macedonia[/i] JBMO 2017, Q4

Which is the least positive integer $n$ for which it is possible to find a (non-degenerate) $n$-gon with sidelengths $1, 2,. . . , n$, and where all vertices have integer coordinates?

A square of side $n$ ($n$ natural) is divided into $n^2$ squares of side $1$. Each pair of "horizontal" boundary lines and each pair of "vertical" boundary lines enclose a rectangle (a square is also considered a rectangle). A rectangle has a length and a width; the width is less than or equal to the length. (a) Prove that there are $8$ rectangles of width $n - 1$. (b) Determine the number of rectangles with width $n -k$ ($0\le k \le n -1,k$ integer). (c) Determine a formula for $1^3 + 2^3 +...+ n^3$.

Given $19$ points in the plane with integer coordinates, no three collinear, show that we can always find three points whose centroid has integer coordinates.

Prove that for each $n \ge 4$ a parallelogram can be dissected in $n$ cyclic quadrilaterals.

6. The baker has baked a rectangular pancake. He then cut it into $n^{2}$ rectangles by making $n-1$ horizontal and $n-1$ vertical cuts. Being rounded to the closest integer, the areas of resulting rectangles equal to all positive integers from 1 to $n^{2}$ in some order. For which maximal $n$ could this happen? (Half-integers are rounded upwards.) Georgy Karavaev

Find the largest possible number of intersection points of the diagonals of a convex $n$-gon.

Given $n>4$ points in the plane, no three collinear. Prove that there are at least $\frac{(n-3)(n-4)}{2}$ convex quadrilaterals with vertices amongst the $n$ points.

Five points are given in space, no four of which are coplanar. Each of the segments connecting two of them is painted in white, green or red, so that all the colors are used and no three segments of the same color form a triangle. Prove that among these five points there is one at which segments of all the three colors meet.

Initially, all the squares of an $8\times 8$ grid are white. You start by choosing one of the squares and coloring it gray. After that, you may color additional squares gray one at a time, but you may only color a square gray if it has exactly $1$ or $3$ gray neighbors at that moment (where a neighbor is a square sharing an edge). For example, the configuration below (of a smaller $3\times 4$ grid) shows a situation where six squares have been colored gray so far. The squares that can be colored at the next step are marked with a dot. Is it possible to color all the squares gray? Justify your answer. [img]https://cdn.artofproblemsolving.com/attachments/1/c/d50ab269f481e4e516dace06a991e6b37f2a85.png[/img]

Prove that for every positive integer $n$ there exists a (not necessarily convex) polygon with no three collinear vertices, which admits exactly $n$ diffferent triangulations. (A [i]triangulation[/i] is a dissection of the polygon into triangles by interior diagonals which have no common interior points with each other nor with the sides of the polygon)

We are given $3n$ points $A_1,A_2, \ldots , A_{3n}$ in the plane, no three of them collinear. Prove that one can construct $n$ disjoint triangles with vertices at the points $A_i.$

The vertices of a triangle are three-dimensional lattice points. Show that its area is at least $\frac12$.

Given $50$ segments on the line. Prove that one of the following statements is valid: 1. Some $8$ segments have the common point. 2. Some $8$ segments do not intersect each other.

A grasshopper is hopping in the angle $x\ge 0, y\ge 0$ of the coordinate plane (that means that it cannot land in the point with negative coordinate). If it is in the point $(x,y)$, it can either jump to the point $(x+1,y-1)$, or to the point $(x-5,y+7)$. Draw a set of such an initial points $(x,y)$, that having started from there, a grasshopper cannot reach any point farther than $1000$ from the point $(0,0)$. Find its area.

Let $P$ be a convex polygon in the plane. Show that there exists a circle containing the entire polygon $P$ and having at least three adjacent vertices of $P$ on its boundary.

A game has two players. In the game there is a rectangular chocolate bar, with $60$ pieces, arranged in a $6 \times 1 0$ formation , which can be broken only along the lines dividing the pieces. The first player breaks the bar along one line, discarding one section . The second player then breaks the remaining section, discarding one section. The first player repeats this process with the remaining section , and so on. The game is won by the player who leaves a single piece. In a perfect game which player wins? {S. Fomin , Leningrad)

Draw all the diagonals of a convex polygon of $10$ sides. They divide their angles into $80$ parts. It is known that at least $59$ of those parts are equal. Determine the largest number of distinct values ​​among the $ 80$ angles of division and how many times each of those values ​​occurs.

There is a cube of $3 \times 3 \times 3$ formed by the union of $27$ cubes of $1 \times 1 \times 1$. Some cubes are removed in such a way that those that remain continue to form a solid made up of cubes that are united by at least one facing the rest of the solid. When a cube is removed, those that remain do so in the same place they were. What is the maximum number of cubes that can be removed so that the area of the resulting solid is equal to the area of the original cube?

Integers $1, 2,...,100$ are written on a circle, not necessarily in that order. Can it be that the absolute value of the dierence between any two adjacent integers is at least $30$ and at most $50$?

a) Given a big square consisting of $7\times 7$ squares. You should mark the centres of $k$ points in such a way, that no quadruple of the marked points will be the vertices of a rectangle with the sides parallel to the sides of the given squares. What is the greatest $k$ such that the problem has solution? b) The same problem for $13\times 13$ square.

Given a finite set $K_0$ of points (in the plane or space). The sequence of sets $K_1, K_2, ... , K_n, ...$ is constructed according to the rule: [i]we take all the points of $K_i$, add all the symmetric points with respect to all its points, and, thus obtain $K_{i+1}$.[/i] a) Let $K_0$ consist of two points $A$ and $B$ with the distance $1$ unit between them. For what $n$ the set $K_n$ contains the point that is $1000$ units far from $A$? b) Let $K_0$ consist of three points that are the vertices of the equilateral triangle with the unit square. Find the area of minimal convex polygon containing $K_n. K_0$ below is the set of the unit volume tetrahedron vertices. c) How many faces contain the minimal convex polyhedron containing $K_1$? d) What is the volume of the above mentioned polyhedron? e) What is the volume of the minimal convex polyhedron containing $K_n$?