Does there exist a convex pentagon from which a similar pentagon can be cut off by a straight line? (S Tokarev)

We have $n$ points in the plane, no three on a line. We call $k$ of them good if they form a convex polygon and there is no other point in the convex polygon. Suppose that for a fixed $k$ the number of $k$ good points is $c_k$. Show that the following sum is independent of the structure of points and only depends on $n$ : \[ \sum_{i=3}^n (-1)^i c_i \]

Let $\mathcal{P}$ be a convex polygon and $\textbf{T}$ be a triangle with vertices among the vertices of $\mathcal{P}$. By removing $\textbf{T}$ from $\mathcal{P}$, we end up with $0, 1, 2,$ or $3$ smaller polygons (possibly with shared vertices) which we call the effect of $\textbf{T}$. A triangulation of $P$ is a way of dissecting it into some triangles using some non-intersecting diagonals. We call a triangulation of $\mathcal{P}$ $\underline{\text{beautiful}}$, if for each of its triangles, the effect of this triangle contains exactly one polygon with an odd number of vertices. Prove that a triangulation of $\mathcal{P}$ is beautiful if and only if we can remove some of its diagonals and end up with all regions as quadrilaterals.

In a circle with a radius of $1$, $64$ mutually different points are selected. Prove that $10$ mutually different points can be selected from them, which lie in a circle with a radius $\frac12$.

Consider an $m\times n$ board where $m, n \ge 3$ are positive integers, divided into unit squares. Initially all the squares are white. What is the minimum number of squares that need to be painted red such that each $3\times 3$ square contains at least two red squares? Andrei Eckstein and Alexandru Mihalcu

Let $f(n)$ be the least number of distinct points in the plane such that for each $k = 1, 2, \cdots, n$ there exists a straight line containing exactly $k$ of these points. Find an explicit expression for $f(n).$ [i]Simplified version.[/i] Show that $f(n)=\left[\frac{n+1}{2}\right]\left[\frac{n+2}{2}\right].$ Where $[x]$ denoting the greatest integer not exceeding $x.$

Vera has several identical matches, from which she makes a triangle. Vera wants any two sides of this triangle to differ in length by at least $10$ matches, but it turned out that it is impossible to add such a triangle from the available matches (it is impossible to leave extra matches). What is the maximum number of matches Vera can have?

Kevin has a set $S$ of $2014$ points scattered on an infinitely large planar gameboard. Because he is bored, he asks Ashley to evaluate \[ x = 4f_4 + 6f_6 + 8f_8 + 10f_{10} + \cdots \] while he evaluates \[ y = 3f_3 + 5f_5+7f_7+9f_9 + \cdots, \] where $f_k$ denotes the number of convex $k$-gons whose vertices lie in $S$ but none of whose interior points lie in $S$. However, since Kevin wishes to one-up everything that Ashley does, he secretly positions the points so that $y-x$ is as large as possible, but in order to avoid suspicion, he makes sure no three points lie on a single line. Find $\left\lvert y-x \right\rvert$. [i]Proposed by Robin Park[/i]

A page of an exercise book is painted with $23$ colours, arranged in squares. A pair of colours is called [i]good [/i] if there are neighbouring squares painted with these colours. What is the minimum number of good pairs?

We are given a cube with edges of length $n$ cm. At our disposal is a long piece of insulating tape of width $1$ cm. It is required to stick this tape to the cube. The tape may freely cross an edge of the cube on to a different face but it must always be parallel to an edge of the cube. It may not overhang the edge of a face or cross over a vertex. How many pieces of the tape are necessary in order to completely cover the cube? (You may assume that $n$ is an integer.) (A Spivak)

Let $K$ be a cube with edge $n$, where $n>2$ is an even integer. Cube $K$ is divided into $n^3$ unit cubes. We call any set of $n^2$ unit cubes lying on the same horizontal or vertical level a layer. We dispose of $\frac{n^3}4$ colors, in each of which we paint exactly $4$ unit cubes. Prove that we can always select $n$ unit cubes of distinct colors, no two of which lie on the same layer.

Suppose we have two identical cardboard polygons. We placed one polygon upon the other one and aligned. Then we pierced polygons with a pin at a point. Then we turned one of the polygons around this pin by $25^o 30'$. It turned out that the polygons coincided (aligned again). What is the minimal possible number of sides of the polygons?

Prove that from any finite set of points on the plane, you can remove a point from the bottom in such a way that the remaining set can be split into two parts of smaller diameter. (Diameter is the maximum distance between points of the set.) [hide=original wording]Докажите, что из любого конечного множества точек на плоскости можно так удалитьо дну точку, что оставшееся множество можно разбить на две части меньшего диаметра. (Диаметр—это максимальное расстояние между точками множества.)[/hide]

For which positive integers $n\geq4$ does there exist a convex $n$-gon with side lengths $1, 2, \dots, n$ (in some order) and with all of its sides tangent to the same circle?

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?

Let $n$ be a positive integer and let $\triangle$ be the closed triangular domain with vertices at the lattice points $(0, 0), (n, 0)$ and $(0, n)$. Determine the maximal cardinality a set $S$ of lattice points in $\triangle$ may have, if the line through every pair of distinct points in $S$ is parallel to no side of $\triangle$.

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.

For what values of $n$ is it possible to paint the edges of a prism whose base is an $n$-gon so that there are edges of all three colours at each vertex and all the faces (including the upper and lower bases) have edges of all three colours? (AV Shapovelov)

Fix a positive integer $n\ge 2$. For any cyclic $2n$-gon $P_1 P_2\cdots P_{2n}$ in this order, define its score as the maximal possible value of $$\angle P_iXP_{i+1} + \angle P_{i+n}XP_{i+n+1}$$ across all $1\le i\le n$ (indices modulo $n$), and over all points $X$ inside the $2n$-gon including its boundary. Prove that there exist a real number $r$ such that a cyclic $2n$-gon is regular if and only if it has score $r$. [i]Proposed by Wong Jer Ren[/i]

In how many ways can you choose $ k $ squares on a chessboard $ n \times n $ ( $ k \leq n $) so that no two of the chosen squares lie in the same row or column?

Assume there are $ n\ge3$ points in the plane, Prove that there exist three points $ A,B,C$ satisfying $ 1\le\frac{AB}{AC}\le\frac{n\plus{}1}{n\minus{}1}.$

Georg has a set of sticks. From these sticks he must create a closed figure with the property that each stick makes right angles with its neighbouring sticks. All the sticks must be used. If the sticks have the lengths $1, 1, 2, 2, 2, 3, 3$ and $4$, the figure might for example look like this: [img]https://cdn.artofproblemsolving.com/attachments/9/7/c16a3143a52ec6f442208c63b41f2df1ae735c.png[/img] (a) Prove that he can create such a figure if the sticks have the lengths $1, 1, 1, 2, 2, 3, 4$ and $4$. (b) Prove that it cannot be done if the sticks have the lengths $1, 2, 2, 3, 3, 3, 4, 4$ and $4$. (c) Determine whether it is doable if the sticks have the lengths $1, 2, 2, 2, 3, 3, 3, 4, 4$ and $5$.

Show that a unit square can be covered with three equal disks with radius less than $\frac{1}{\sqrt{2}}$. What is the smallest possible radius?

For which natural number $n$ is it possible to draw $n$ line segments between vertices of a regular $2n$-gon so that every vertex is an endpoint for exactly one segment and these segments have pairwise different lengths?

You are given a square $n \times n$. The centers of some of some $m$ of its $1\times 1$ cells are marked. It turned out that there is no convex quadrilateral with vertices at these marked points. For each positive integer $n \geq 3$, find the largest value of $m$ for which it is possible. [i]Proposed by Oleksiy Masalitin, Fedir Yudin[/i]