$5$ points are given in the plane, any three non-collinear and any four non-concyclic. If three points determine a circle that has one of the remaining points inside it and the other one outside it, then the circle is said to be [i]good[/i]. Let the number of good circles be $n$; find all possible values of $n$.

A black unit equilateral triangle is drawn on the plane. How can we place nine tiles, each a unit equilateral triangle, on the plane so that they do not overlap, and each tile covers at least one interior point of the black triangle? (Folklore)

Given a cube with a side of $4$. Is it possible to completely cover $3$ of its faces, which have a common vertex, with sixteen rectangular paper strips measuring $1 \times3$?

There are pieces in the shape of an equilateral triangle with sides $1, 2, 3, 4, 5$ and $6$ ($50$ pieces of each size). You want to build an equilateral triangle of side $7$ using some of these pieces, without gaps or overlaps. What is the least number of pieces needed?

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?

Let $A{}$ be a point in the Cartesian plane. At each step, Ann tells Bob a number $0< a\leqslant 1$ and he then moves $A{}$ in one of the four cardinal directions, at his choice, by a distance of $a{}$. This process cotinues as long as Ann wishes. Amongst every $100$ consecutive moves, each of the four possible moves should have been made at least once. Ann's goal is to force Bob to eventually choose a point at a distance greater than $100$ from the initial position of $A{}$. Can Ann achieve her goal?

Find all pairs $(m, n)$ of positive integers such that the $m \times n$ grid contains exactly $225$ rectangles whose side lengths are odd and whose edges lie on the lines of the grid.

The set $M$ consists of $n$ points on the plane and satisfies the conditions: $\bullet$ there are $7$ points in the set $M$, which are vertices of a convex heptagon, $\bullet$ for arbitrary five points with $M$, which are vertices of a convex pentagon, there is a point that also belongs to $M$ and lies inside this pentagon. Find the smallest possible value that $n$ can take .

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 )

Let $n$ and $m$ be fixed positive integers. The hexagon $ABCDEF$ with vertices $A = (0,0)$, $B = (n,0)$, $C = (n,m)$, $D = (n-1,m)$, $E = (n-1,1)$, $F = (0,1)$ has been partitioned into $n+m-1$ unit squares. Find the number of paths from $A$ to $C$ along grid lines, passing through every grid node at most once.

The plane is cut up into equilateral triangles by three families of parallel lines. Is it possible to find $4$ vertices of these triangles which form a square?

Let $ L $ be the set of all polylines $ ABCDA $, where $ A, B, C, D $ are different vertices of a fixed regular $1985$ -gon. We randomly select a polyline from the set $L$. Calculate the probability that it is the side of a convex quadrilateral.

Cut a rectangle into $18$ rectangles so that no two adjacent ones form a rectangle.

Three different points were randomly selected from the vertices of the regular $2n$-gon. Let $ p_n $ be the probability of the event that the triangle with vertices at the selected points is acute-angled. Calculate $ \lim_{n\to \infty} p_n $. Attention. We assume that all choices of three different points are equally likely.

Given a sheet of tin $6\times 6$. It is allowed to bend it and to cut it but in such a way that it doesn’t fall to pieces. How to make a cube with edge $2$, divided by partitions into unit cubes?

Does there exist a convex polygon such that all its sidelengths are equal and all triangle formed by its vertices are obtuse-angled?

All the faces of a convex polyhedron are the triangles. Prove that it is possible to paint all its edges in red and blue colour in such a way, that it is possible to move from the arbitrary vertex to every vertex along the blue edges only and along the red edges only.

Prove that for all natural $n\ge 6 000$ any convex $1994$-gon can be cut into $n$ such quadrilaterals thata circle can be circumscribed around each of them

A $101$-gon is inscribed in a circle. From each vertex of this polygon a perpendicular is dropped to the opposite side or its extension. Prove that at least one perpendicular drops to the side.

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?

Let $\mathcal{S}$ be a finite set of at least two points in the plane. Assume that no three points of $\mathcal S$ are collinear. A [i]windmill[/i] is a process that starts with a line $\ell$ going through a single point $P \in \mathcal S$. The line rotates clockwise about the [i]pivot[/i] $P$ until the first time that the line meets some other point belonging to $\mathcal S$. This point, $Q$, takes over as the new pivot, and the line now rotates clockwise about $Q$, until it next meets a point of $\mathcal S$. This process continues indefinitely. Show that we can choose a point $P$ in $\mathcal S$ and a line $\ell$ going through $P$ such that the resulting windmill uses each point of $\mathcal S$ as a pivot infinitely many times. [i]Proposed by Geoffrey Smith, United Kingdom[/i]

We call a set of cells on a checkered plane [i]rook-connected[/i] if from any of its cells one can get to any other by moving along the cells of this set by moving the rook (the rook is allowed to fly through fields that do not belong to our set). Prove that a [i]rook-connected[/i] set of $100$ cells can be divided into pairs of cells, lying in one row or in one column.

In a country there are $2014$ airports, no three of them lying on a line. Two airports are connected by a direct flight if and only if the line passing through them divides the country in two parts, each with $1006$ airports in it. Show that there are no two airports such that one can travel from the first to the second, visiting each of the $2014$ airports exactly once.

Alice and Bob play a game, in which they take turns drawing segments of length $1$ in the Euclidean plane. Alice begins, drawing the first segment, and from then on, each segment must start at the endpoint of the previous segment. It is not permitted to draw the segment lying over the preceding one. If the new segment shares at least one point - except for its starting point - with one of the previously drawn segments, one has lost. a) Show that both Alice and Bob could force the game to end, if they don’t care who wins. b) Is there a winning strategy for one of them?

Given a rectangle $\mathcal{R}$ of area $100000 $, Pancho must completely cover the rectangle $\mathcal{R}$ with a finite number of rectangles with sides parallel to the sides of $\mathcal{R}$ . Next, Martín colors some rectangles of Pancho's cover red so that no two red rectangles have interior points in common. If the red area is greater than $0.00001$, Martin wins. Otherwise, Pancho wins. Prove that Pancho can cover to ensure victory,