All faces of the tetrahedron $ABCD$ are acute-angled. Take a point $X$ in the interior of the segment $AB$, and similarly $Y$ in $BC, Z$ in $CD$ and $T$ in $AD$. [b]a.)[/b] If $\angle DAB+\angle BCD\ne\angle CDA+\angle ABC$, then prove none of the closed paths $XYZTX$ has minimal length; [b]b.)[/b] If $\angle DAB+\angle BCD=\angle CDA+\angle ABC$, then there are infinitely many shortest paths $XYZTX$, each with length $2AC\sin k$, where $2k=\angle BAC+\angle CAD+\angle DAB$.

Let $n$ be a positive integer. Define a chameleon to be any sequence of $3n$ letters, with exactly $n$ occurrences of each of the letters $a, b,$ and $c$. Define a swap to be the transposition of two adjacent letters in a chameleon. Prove that for any chameleon $X$ , there exists a chameleon $Y$ such that $X$ cannot be changed to $Y$ using fewer than $3n^2/2$ swaps.

Let $n$ be a positive integer. Define a chameleon to be any sequence of $3n$ letters, with exactly $n$ occurrences of each of the letters $a, b,$ and $c$. Define a swap to be the transposition of two adjacent letters in a chameleon. Prove that for any chameleon $X$ , there exists a chameleon $Y$ such that $X$ cannot be changed to $Y$ using fewer than $3n^2/2$ swaps.

The quadrilateral $ABCD$ is inscribed in a circle of radius $1$, so that $AB$ is a diameter of the circumference and $CD = 1$. A variable point $X$ moves along the semicircle determined by $AB$ that does not contain $C$ or $D$. Determine the position of $X$ for which the sum of the distances from $X$ to lines $BC, CD$ and $DA$ is maximum.

Two circles $\omega_1$ and $\omega_2$ with centers $O_1$ and $O_2$ meet at points $A$ and $B$. Points $C$ and $D$ on $\omega_1$ and $\omega_2$, respectively, lie on the opposite sides of the line $AB$ and are equidistant from this line. Prove that $C$ and $D$ are equidistant from the midpoint of $O_1O_2$.

Lyuba, Tanya, Lena and Ira ran across a flat field. At some point it turned out that among the pairwise distances between them there are distances of $1, 2, 3, 4$ and $5$ meters, and there are no other distances. Give an example of how this could be.

The $ABCDA_1B_1C_1D_1$ cube has unit length edges. Find the distance between two circumferences, one of those is inscribed into the $ABCD$ base, and another comes through points $A,C$ and $B_1$ .

Let $n>1$ be an integer. Hippo chooses a list of $n$ points in the plane $P_1, \dots, P_n$; some of these points may coincide, but not all of them can be identical. After this, Wombat picks a point from the list $X$ and measures the distances from it to the other $n-1$ points in the list. The average of the resulting $n-1$ numbers will be denoted $m(X)$. Find all values of $n$ for which Hippo can prepare the list in such a way, that for any point $X$ Wombat may pick, he can point to a point $Y$ from the list such that $XY=m(X)$.

Let $n>1$ be an integer. Hippo chooses a list of $n$ points in the plane $P_1, \dots, P_n$; some of these points may coincide, but not all of them can be identical. After this, Wombat picks a point from the list $X$ and measures the distances from it to the other $n-1$ points in the list. The average of the resulting $n-1$ numbers will be denoted $m(X)$. Find all values of $n$ for which Hippo can prepare the list in such a way, that for any point $X$ Wombat may pick, he can point to a point $Y$ from the list such that $XY=m(X)$.

There are $50$ exact watches lying on a table. Prove that there exist a certain moment, when the sum of the distances from the centre of the table to the ends of the minute hands is more than the sum of the distances from the centre of the table to the centres of the watches.

An ant is moving on the cooridnate plane, starting form point $(0,-1)$ along a straight line until it reaches the $x$- axis at point $(x,0)$ where $x$ is a real number. After it turns $90^o$ to the left and moves again along a straight line until it reaches the $y$-axis . Then it again turns left and moves along a straight line until it reaches the $x$-axis, where it once more turns left by $90^o$ and moves along a straight line until it finally reached the $y$-axis. Can both the length of the ant's journey and distance between it's initial and final point be: (a) rational numbers ? (b) integers? Justify your answers PS. Collected [url=https://artofproblemsolving.com/community/c949609_2019_nigerian_senior_mo_round_4]here[/url]

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

In three houses $A,B$ and $C$, forming a right triangle with the legs $AC=30$ and $CB=40$, live three beetles $a,b$ and $c$, capable of moving at speeds of $2, 3$ and $4$, respectively. Suppose that you simultaneously release these bugs from point $M$ and mark the time after which beetles reach their homes. Find on the plane such a point $M$, where is the last time to reach the house a bug would be minimal.

In a parallelogram $ABCD$, let $M$ be the point on the $BC$ side such that $MC = 2BM$ and let $N$ be the point of side $CD$ such that $NC = 2DN$. If the distance from point $B$ to the line $AM$ is $3$, calculate the distance from point $N$ to the line $AM$.

Let eight points be given in a unit cube. Prove that two of these points are on a distance not greater than $1$.