The radius $OM$ of a circle rotates uniformly at a rate of $360/n$ degrees per second , where $n$ is a positive integer . The initial radius is $OM_0$. After $1$ second the radius is $OM_1$ , after two more seconds (i.e. after three seconds altogether) the radius is $OM_2$ , after $3$ more seconds (after $6$ seconds altogether) the radius is $OM_3$, ..., after $n - 1$ more seconds its position is $OM_{n-1}$. For which values of $n$ do the points $M_0, M_1 , ..., M_{n-1}$ divide the circle into $n$ equal arcs? (a) Is it true that the powers of $2$ are such values? (b) Does there exist such a value which is not a power of $2$? (V. V. Proizvolov , Moscow)

Let \(n\) be a positive integer. The kingdom of Zoomtopia is a convex polygon with integer sides, perimeter \(6n\), and \(60^\circ\) rotational symmetry (that is, there is a point \(O\) such that a \(60^\circ\) rotation about \(O\) maps the polygon to itself). In light of the pandemic, the government of Zoomtopia would like to relocate its \(3n^2+3n+1\) citizens at \(3n^2+3n+1\) points in the kingdom so that every two citizens have a distance of at least \(1\) for proper social distancing. Prove that this is possible. (The kingdom is assumed to contain its boundary.) [i]Proposed by Ankan Bhattacharya, USA[/i]

A piece of rectangular paper $20 \times 19$, divided into four units, is cut into several square pieces, the cuts being along the sides of the unit squares. Such a square piece is called odd square if the length of its side is an odd number. a) What is the minimum possible number of odd squares? b) What is the smallest value that the sum of the perimeters of the odd squares can take?

Given two closed broken lines in the plane with odd numbers of edges. All the lines, containing those edges are different, and not a triple of them intersects in one point. Prove that it is possible to chose one edge from each line such, that the chosen edges will be the opposite sides of a convex quadrangle.

For what $n$ can the vertices of a regular $n$-gon be connected in a $n$-link closed polyline so that such a polyline does not have three equal links?

Given $100$ coplanar points, no three collinear, prove that at most $70\%$ of the triangles formed by the points have all angles acute.

Let $k$ be a positive integer. Find all positive integers $n$, such that it is possible to mark $n$ points on the sides of a triangle (different from its vertices) and connect some of them with a line in such a way that the following conditions are satisfied: 1) there is at least $1$ marked point on each side, 2) for each pair of points $X$ and $Y$ marked on different sides, on the third side there exist exactly $k$ marked points which are connected to both $X$ and $Y$ and exactly k points which are connected to neither $X$ nor $Y$

The pieces in a game are squares of side $1$ with their sides colored with $4$ colors: blue, red, yellow and green, so that each piece has one side of each color. There are pieces in every possible color arrangement, and the game has a million pieces of each kind. With the pieces, rectangular puzzles are assembled, without gaps or overlaps, so that two pieces that share a side have that side of the same color. Determine if with this procedure you can make a rectangle of $99\times 2007$ with one side of each color. And $100\times 2008$? And $99\times 2008$?

There are $n$ points in the plane so that no two pairs are equidistant. Each point is connected to the nearest point by a segment. Show that no point is connected to more than five points.

Let two ants stand on the perimeter of a regular $2019$-gon of unit side length. One of them stands on a vertex and the other one is on the midpoint of the opposite side. They start walking along the perimeter at the same speed counterclockwise. The locus of their midpoints traces out a figure $P$ in the plane with $N$ corners. Let the area enclosed by the convex hull of $P$ be $\tfrac{A}{B}\tfrac{\sin^m\left(\tfrac{\pi}{4038}\right)}{\tan\left(\tfrac{\pi}{2019}\right)}$, where $A$ and $B$ are coprime positive integers, and $m$ is the smallest possible positive integer such that this formula holds. Find $A+B+m+N$. [i]Note:[/i] The [i]convex hull[/i] of a figure $P$ is the convex polygon of smallest area which contains $P$.

We are given a family of discs in the plane, with pairwise disjoint interiors. Each disc is tangent to at least six other discs of the family. Show that the family is infinite.

In a faraway place in the Universe, a villain has a medal with special powers and wants to hide it so that no one else can use it. For this, the villain hides it in a vertex of a regular polygon with $2019$ sides. Olcoman, the savior of the Olcomita people, wants to get the medal to restore peace in the Universe, for which you have to pay $1000$ olcolones for each time he makes the following move: on each turn he chooses a vertex of the polygon, which turns green if the medal is on it or in one of the four vertices closest to it, or otherwise red. Find the fewest olcolones Olcoman needs to determine with certainty the position of the medal.

Let $T$ be a non-isosceles triangle and $n \ge 4$ an integer . Prove that you can divide $T$ in $n$ triangles and draw in each of them an inner bisector so that those $n$ bisectors are parallel.

Α disk of radius $1$ is covered by seven identical disks. Prove that their radii are not less than $\frac12$ .

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.

Wiebke and Stefan play the following game on a rectangular sheet of paper. They start with a rectangle with $60$ rows and $40$ columns and cut it in turns into smaller rectangles. The cuttings must be made along the gridlines, and a player in turn may cut only one smaller rectangle. By that, Stefan makes only vertical cuts, while Wiebke makes only horizontal cuts. A player who cannot make a regular move loses the game. (a) Who has a winning strategy if Stefan makes the first move? (b) Who has a winning strategy if Wiebke makes the first move?

A regular $2012$-gon is inscribed in a circle. Find the maximal $k$ such that we can choose $k$ vertices from given $2012$ and construct a convex $k$-gon without parallel sides.

A cube side $100$ is divided into a million unit cubes with faces parallel to the large cube. The edges form a lattice. A prong is any three unit edges with a common vertex. Can we decompose the lattice into prongs with no common edges?

The numbers $1, 2, 3, ..., 99, 100$ are randomly arranged in the cells of a square table measuring $10\times 10$ (each number is used only once). Prove that there are three cells in the table whose sum of numbers does not exceed 1$82$. The centers of these cells form an isosceles right triangle, the legs of which are parallel to the edges of the table.

Given are $n + 1$ points $P_1, P_2,..., P_n$ and $Q$ in the plane, no three collinear. For any two different points $P_i$ and $P_j$ , there is a point $P_k$ such that the point $Q$ lies inside the triangle $P_iP_jP_k$. Prove that $n$ is an odd number.

n points are taken in the plane, no three collinear. Some of the line segments between the points are painted red and some are painted blue, so that between any two points there is a unique path along colored edges. Show that the uncolored edges can be painted (each edge either red or blue) so that all triangles have an odd number of red sides.

In the lower left corner of the $8 \times 8$ chessboard there is a king. He can move one cell either to the right, or up, or diagonally - to the right and up. How many ways can the king go to the upper right corner of the board if his route does not contain cells located on opposite sides of the diagonal going from the lower left to the upper right corner of the board?

Let $k$, $\ell $ and $m$ be positive integers. Let $ABCDEF$ be a hexagon that has a center of symmetry whose angles are all $120^\circ$ and let its sidelengths be $AB=k$, $BC=\ell$ and $CD=m$. Let $f(k,\ell,m)$ denote the number of ways we can partition hexagon $ABCDEF$ into rhombi with unit sides and an angle of $120^\circ$. Prove that by fixing $\ell$ and $m$, there exists polynomial $g_{\ell,m}$ such that $f(k,\ell,m)=g_{\ell,m}(k)$ for every positive integer $k$, and find the degree of $g_{\ell,m}$ in terms of $\ell$ and $m$. [i]Submitted by Zoltán Gyenes, Budapest[/i]

How many paths are there from $A$ to $B$ that consist of $5$ horizontal segments and $5$ vertical segments of length $1$ each? (see figure) [img]https://cdn.artofproblemsolving.com/attachments/4/2/5b476ca2a232fc67fb2e2f6bb06111cab60692.png[/img]

For dessert, Melinda eats a spherical scoop of ice cream with diameter $2$ inches. She prefers to eat her ice cream in cube-like shapes, however. She has a special machine which, given a sphere placed in space, cuts it through the planes $x = n$, $y = n$, and $z = n$ for every integer $n$ (not necessarily positive). Melinda centers the scoop of ice cream uniformly at random inside the cube $0 \le x, y,z \le 1$, and then cuts it into pieces using her machine. What is the expected number of pieces she cuts the ice cream into?