Consider $n \ge 2$ pairwise disjoint disks $D_1,D_2,\ldots,D_n$ on the Euclidean plane. For each $k=1,2,\ldots,n$, denote by $f_k$ the inversion with respect to the boundary circle of $D_k$. (Here, $f_k$ is defined at every point of the plane, except for the center of $D_k$.) How many fixed points can the transformation $f_n\circ f_{n-1}\circ\ldots\circ f_1$ have, if it is defined on the largest possible subset of the plane?

A circle is divided into $n$ equal arcs by $n$ points. Assume that, no matter how we color the $n$ points in two colors, there always exists an axis of symmetry of the set of points such that any two of the $n$ points which are symmetric with respect to that axis have the same color. Find all possible values of $n$.

On a circular billiard table a ball rebounds from the rails as if the rail was the tangent to the circle at the point of impact. A regular hexagon with its vertices on the circle is drawn on a circular billiard table. A (point-shaped) ball is placed somewhere on the circumference of the hexagon, but not on one of its edges. Describe a periodical track of this ball with exactly four points at the rails. With how many different directions of impact can the ball be brought onto such a track?

Every cell of a $4\times 4$ square grid net, has $1\times 1$ size. Is it possible to represent this net as a union of the following sets: a) Eight broken lines of length five each? b) Five broken lines of length eight each?

The set Φ consists of a finite number of points on the plane. The distance between any two points from Φ is at least $\sqrt{2}$. It is known that a regular triangle with side lenght $3$ cut out of paper can cover all points of Φ. What is the greatest number of points that Φ can consist of?

The streets of a town are arranged in three directions , dividing the town into blocks which are equilateral triangles of equal area. Traffic , when reaching an intersection, may only go straight ahead, or turn left or right through $120^0$ , as shown in the diagram. [img]https://cdn.artofproblemsolving.com/attachments/3/6/a100a5c39bf15116582bc0bceb76fcbae28af9.png[/img] No turns are permitted except the ones at intersections . One car departs for a certain nearby intersection and when it reaches it a second car starts moving toward it. From then on both cars continue travelling at the same speed (but do not necessarily take the same turns). Is it possible that there will be a time when they will encounter each other somewhere? ( N . N . Konstantinov , Moscow )

Find the largest positive integer $n$ ($n \ge 3$), so that there is a convex $n$-gon, the tangent of each interior angle is an integer.

(a) A point $A$ is marked inside a circle. Two perpendicular lines drawn through $A$ intersect the circle at four points. Prove that the centre of mass of these four points does not depend on the choice of the lines. (b) A regular $2n$-gon ($n \ge 2$) with centre $A$ is drawn inside a circle (A does not necessarily coincide with the centre of the circle). The rays going from $A$ to the vertices of the $2n$-gon mark $2n$ points on the circle. Then the $2n$-gon is rotated about $A$. The rays going from $A$ to the new locations of vertices mark new $2n$ points on the circle. Let $O$ and $N$ be the centres of gravity of old and new points respectively. Prove that $O = N$.

Let $n \geq 5$ be an integer. Consider $n$ squares with side lengths $1, 2, \dots , n$, respectively. The squares are arranged in the plane with their sides parallel to the $x$ and $y$ axes. Suppose that no two squares touch, except possibly at their vertices. Show that it is possible to arrange these squares in a way such that every square touches exactly two other squares.

Does there exist a convex polyhedron which has a triangular section (by a plane not passing through the vertices) and each vertex of the polyhedron belonging to (a) no less than $ 5$ faces? (b) exactly $5$ faces? (G. Galperin)

Turki has divided a square into finitely many white and green rectangles, each with sides parallel to the sides of the square. Within each white rectangle, he writes down its width divided by its height. Within each green rectangle, he writes down its height divided by its width. Finally, he calculates $S$, the sum of these numbers. If the total area of white rectangles equals the total area of green rectangles, determine the minimum possible value of $S$.

Let $N$ be the number of convex $27$-gons up to rotation there are such that each side has length $ 1$ and each angle is a multiple of $2\pi/81$. Find the remainder when $N$ is divided by $23$.

Given an equilateral triangle lattice composed of $\frac{n(n+1)}{2}$ points (as shown in the figure), record the number of equilateral triangles with three points in the lattice as vertices as $f(n)$. Find an expression for $f(n)$. [img]https://cdn.artofproblemsolving.com/attachments/7/f/1de27231e8ef9c1c6a3dfd590a7c71adc508d6.png[/img]

Two mirror walls are placed to form an angle of measure $\alpha$. There is a candle inside the angle. How many reflections of the candle can an observer see?

Given right hexagon. The lines parallel to all the sides are drawn from all the vertices and midpoints of the sides (consider only the interior, with respect to the hexagon, parts of those lines). Thus the hexagon is divided onto $24$ triangles, and the figure has $19$ nodes. $19$ different numbers are written in those nodes. Prove that at least $7$ of $24$ triangles have the property: the numbers in its vertices increase (from the least to the greatest) counterclockwise.

In a square $10^{2019} \times 10^{2019}, 10^{4038}$ points are marked. Prove that there is such a rectangle with sides parallel to the sides of a square whose area differs from the number of points located in it by at least $6$.

Given seven points on a plane, with no three points collinear. Prove that it is always possible to divide these points into the vertices of a triangle and a convex quadrilateral, with no shared parts between the two shapes.

$2013$ people run a marathon on a straight road $4m$ wide broad. At any given moment, no two runners are closer $2$ m from each other. Prove that there are two runners that at that moment are more than $1052$ m from each other. Note: Consider runners as points.

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$.

The figure obtained by removing one small unit square from the $2\times 2$ grid table is called an $L$ ''shape". .Put $k$ L-shapes in an $8\times 8$ grid table. Each $L$-shape can be rotated, but each $L$ shape is required to cover exactly three small unit squares in the grid table, and the common area covered by any two $L$ shapes is $0$, and except for these $k$ $L$ shapes, no other $L$ shapes can be placed. Find the minimum value of $k$.

Given a horizontal strip on the plane (its sides are parallel lines) and $n$ lines intersecting the strip. Every two of them intersect inside the strip, and not a triple has a common point. Consider all the paths along the segments of those lines, starting on the lower side of the strip and ending on the upper side with the properties: moving along such a path we are constantly rising up, and, having reached the intersection, we are obliged to turn to another line. Prove that: a) there are not less than $n/2$ such a paths without common points; b) there is a path consisting of not less than of $n$ segments; c) there is a path that goes along not more than along $n/2+1$ lines; d) there is a path that goes along all the $n$ lines.

Given $n$ points, some of them connected by non-intersecting segments. You can reach every point from every one, moving along the segments, and there is no couple, connected by two different ways. Prove that the total number of the segments is $(n-1)$.

An $m\times n(m,n\in \mathbb{N}^*)$ rectangle is divided into some smaller squares. The sides of each square are all parallel to the corresponding sides of the rectangle, and the length of each side is integer. Determine the minimum of the sum of the sides of these squares.

In the plane we are given two circles intersecting at $ X$ and $ Y$. Prove that there exist four points with the following property: (P) For every circle touching the two given circles at $ A$ and $ B$, and meeting the line $ XY$ at $ C$ and $ D$, each of the lines $ AC$, $ AD$, $ BC$, $ BD$ passes through one of these points.

Consider $n$ different points lying on a circle, such that there are not three chords defined by that point that pass through the same interior point of the circle. a) Find the value of $n$, if the numbers of triangles that are defined using $3$ of the n points is equal to $2n$ b) Find the value of $n$, if the numbers of the intersection points of the chords that are interior to the circle is equal to $5n$.