Is it possible to divide a polygon with $21$ sides into $2022$ triangles in such a way that among all the vertices there are not three collinear?

A strip consists of $n$ squares which are numerated in their order by integers $1,2,3,..., n$. In the beginning, one square is empty while each remaining square contains one piece. Whenever a square contains a piece and its some neighbouring square contains another piece while the square immediately following the neighbouring square is empty, one may raise the first piece over the second one to the empty square, removing the second piece from the strip. Find all possibilites which square can be initially empty, if it is possible to reach a state where the strip contains only one piece and a) $n = 2008$, b) $n = 2009$.

Annie drew a rectangle and partitioned it into $n$ rows and $k$ columns with horizontal and vertical lines. Annie knows the area of the resulting $n \cdot k$ little rectangles while Benny does not. Annie reveals the area of some of these small rectangles to Benny. Given $n$ and $k$ at least how many of the small rectangle’s areas did Annie have to reveal, if from the given information Benny can determine the areas of all the $n \cdot k$ little rectangles? For example in the case $n = 3$ and $k = 4$ revealing the areas of the $10$ small rectangles if enough information to find the areas of the remaining two little rectangles. [img]https://cdn.artofproblemsolving.com/attachments/b/1/c4b6e0ab6ba50068ced09d2a6fe51e24dd096a.png[/img]

$n$ diameters divide a disk into $2n$ equal sectors. $n$ of the sectors are coloured blue , and the other $n$ are coloured red (in arbitrary order) . Blue sectors are numbered from $1$ to $n$ in the anticlockwise direction, starting from an arbitrary blue sector, and red sectors are numbered from $1$ to $n$ in the clockwise direction, starting from an arbitrary red sector. Prove that there is a semi-disk containing sectors with all numbers from $1$ to $n$. (V Proizvolov)

Given any six points in the plane, no three collinear, show that we can always find three which form an obtuse-angled triangle with one angle at least $120^o$.

Someone draws at least three lines on paper. Each cuts the other lines two by two. No three lines pass through one point. He chooses a line and counts the intersection points on either side of the line. The numbers of intersections turn out to be the same. He chooses another line. Now the intersections number on one side appears to be six times as large as that on the other side. What is the minimum number of lines where this is possible? [hide=original wording of second sentence]De lijnen snijden elkaar twee aan twee.[/hide]

A robotic lawnmower is located in the middle of a large lawn. Due a manufacturing defect, the robot can only move straight ahead and turn in directions that are multiples of $60^o$. A fence must be set up so that it delimits the entire part of the lawn that the robot can get to, by traveling along a curve with length no more than $10$ meters from its starting position, given that it is facing north when it starts. How long must the fence be?

Let $s$ and $t$ be two parallel lines. We have marked $k$ points on line $s$ and $n$ points on line $t$ ($k\geq n$). If it is known that the total number of triangles that have their three vertices at marked points is $220$, find all possible values of $k$ and $n$.

Let $n$ and $c$ be coprime positive integers. For any integer $i$, denote by $i' $ the remainder of division of product $ci$ by $n$. Let $A_o.A_1,A_2,...,A_{n-1}$ be a regular $n$-gon. Prove that a) if $A_iA_j \parallel A_kA_i$ then $A_{i'}A_{j'} \parallel A_{k'}A_{i'}$ b) if $A_iA_j \perp A_kA_l$ then $A_{i'}A_{j'} \perp A_{k'}A_{l'}$

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

Four frogs sit on the vertices of a square, one on each vertex. They jump in arbitrary order but not simultaneously. Each frog jumps to the point symmetrical to its take-off position with respect to the centre of gravity of the three other frogs. Can one of them jump (at a given time) exactly on to one of the others (considering their locations as points)? (A Andzans)

Given four colours and enough square plates $1\times 1$. We have to paint four edges of every plate with four different colours and combine plates, putting them with the edges of the same colour together. Describe all the pairs $m,n$, such that we can combine those plates in a $n\times m$ rectangle, that has every edge of one colour, and its four edges have different colours.

Let $S$ be a set of at least three points of the plane in general position. Prove that there exists a non-intersecting polygon whose vertices are exactly the points of $S$.

There are $12$ points that are vertices of a regular polygon with $12$ sides. Rafael must draw segments that have their two ends at two of the points drawn. He is allowed to have each point be an endpoint of more than one segment and for the segments to intersect, but he is prohibited from drawing three segments that are the three sides of a triangle in which each vertex is one of the $12$ starting points. Find the maximum number of segments Rafael can draw and justify why he cannot draw a greater number of segments.

Six points in general position are given in the space. For each two of them color red the common points (if they exist) of the segment between these points and the surface of the tetrahedron formed by four remaining points. Prove that the number of red points is even.

There are $2017$ lines in the plane such that no three of them go through the same point. Turbo the snail sits on a point on exactly one of the lines and starts sliding along the lines in the following fashion: she moves on a given line until she reaches an intersection of two lines. At the intersection, she follows her journey on the other line turning left or right, alternating her choice at each intersection point she reaches. She can only change direction at an intersection point. Can there exist a line segment through which she passes in both directions during her journey?

Find for which natural numbers $n$ one can color the sides and diagonals of a regular $n$-gon with $n$ colors in such a way that for each triplet in pairs of different colors, a triangle can be found, the sides of which are sides or diagonals of $n$-gon and which is colored with exactly these three colors.

Find all possible numbers of lines in a plane which intersect in exactly $37$ points.

Let $n \geq 5$ be a given integer. Determine the greatest integer $k$ for which there exists a polygon with $n$ vertices (convex or not, with non-selfintersecting boundary) having $k$ internal right angles. [i]Proposed by Juozas Juvencijus Macys, Lithuania[/i]

For a natural number $n \ge 3$, we draw $n - 3$ internal diagonals in a non self-intersecting, but not necessarily convex, n-gon, cutting the $n$-gon into $n - 2$ triangles. It is known that the value (in degrees) of any angle in any of these triangles is a natural number and no two of these angle values are equal. What is the largest possible value of $n$?

Let $K$ be a convex planar set, symmetric about a point $O$, and let $X, Y , Z$ be three points in $K$. Show that $K$ contains the head of one of the vectors $\overrightarrow{OX} \pm \overrightarrow{OY} , \overrightarrow{OX} \pm \overrightarrow{OZ}, \overrightarrow{OY} \pm \overrightarrow{OZ}$.

Let $X = \{(x,y) \in \mathbb{R}^2 | y \geq 0, x^2+y^2 = 1\} \cup \{(x,0),-1\leq x\leq 1\} $ be the edge of the closed semicircle with radius 1. a) Let $n>1$ be an integer and $P_1,P_2,\dots,P_n \in X$. Show that there exists a permutation $\sigma \colon \{1,2,\dots,n\}\to \{1,2,\dots,n\}$ such that \[\sum_{j=1}^{n}|P_{\sigma(j+1)}-P_{\sigma(j)}|^2\leq 8\]. Where $\sigma(n+1) = \sigma(1)$. b) Find all sets $\{P_1,P_2,\dots,P_n \} \subset X$ such that for any permutation $\sigma \colon \{1,2,\dots,n\}\to \{1,2,\dots,n\}$, \[\sum_{j=1}^{n}|P_{\sigma(j+1)}-P_{\sigma(j)}|^2 \geq 8\]. Where $\sigma(n+1) = \sigma(1)$.

$40$ cells were marked on an infinite chessboard. Is it always possible to find a rectangle that contains $20$ marked cells? M. Evdokimov

An segment $S$ of length $50$ is covered by several segments of length $1$ , all of them contained in $S$. If any of these unit segments were removed, $S$ would no longer be completely covered. Find the maximum number of unit segments with this property. Clarification: Assume that the segments include their endpoints.

There are $n$ blue points and $n$ red points on a straight line. Prove that the sum of all distances between pairs of points of the same colour is less than or equal to the sum of all distances between pairs of points of different colours