Let the lines $e$ and $f$ be perpendicular and intersect each other at $H$. Let $A$ and $B$ lie on $e$ and $C$ and $D$ lie on $f$, such that all five points $A,B,C,D$ and $H$ are distinct. Let the lines $b$ and $d$ pass through $B$ and $D$ respectively, perpendicularly to $AC$; let the lines $a$ and $c$ pass through $A$ and $C$ respectively, perpendicularly to $BD$. Let $a$ and $b$ intersect at $X$ and $c$ and $d$ intersect at $Y$. Prove that $XY$ passes through $H$.

For every permutation $ \tau$ of $ 1, 2, \ldots, 10$, $ \tau \equal{} (x_1, x_2, \ldots, x_{10})$, define $ S(\tau) \equal{} \sum_{k \equal{} 1}^{10} |2x_k \minus{} 3x_{k \minus{} 1}|$. Let $ x_{11} \equal{} x_1$. Find [b]I.[/b] The maximum and minimum values of $ S(\tau)$. [b]II.[/b] The number of $ \tau$ which lets $ S(\tau)$ attain its maximum. [b]III.[/b] The number of $ \tau$ which lets $ S(\tau)$ attain its minimum.

[color=darkred]Let $f,g\colon [0,1]\to [0,1]$ be two functions such that $g$ is monotonic, surjective and $|f(x)-f(y)|\le |g(x)-g(y)|$ , for any $x,y\in [0,1]$ . [list] [b]a)[/b] Prove that $f$ is continuous and that there exists some $x_0\in [0,1]$ with $f(x_0)=g(x_0)$ . [b]b)[/b] Prove that the set $\{x\in [0,1]\, |\, f(x)=g(x)\}$ is a closed interval. [/list][/color]

$ABCD$ is a trapezium where $AD\parallel BC$. $P$ is the point on the line $AB$ such that $\angle CPD$ is maximal. $Q$ is the point on the line $CD$ such that $\angle BQA$ is maximal. Given that $P$ lies on the segment $AB$, prove that $\angle CPD=\angle BQA$.

The octagon $P_1P_2P_3P_4P_5P_6P_7P_8$ is inscribed in a circle with the vertices around the circumference in the given order. Given that the polygon $P_1P_3P_5P_7$ is a square of area $5$, and the polygon $P_2P_4P_6P_8$ is a rectangle of area $4$, find the maximum possible area of the octagon.

Let $D$ and $E$ be the midpoints of sides $[AB]$ and $[AC]$ of the triangle $ABC$. The circle of diameter $[AB]$ intersects the line $DE$ on the opposite side of $AB$ than $C$, in $X$. The circle of diameter $[AC]$ intersects $DE$ on the opposite side of $AC$ than $B$ in $Y$ . Let $T$ be the intersection of $BX$ and $CY$. Prove that the orthocenter of triangle $XY T$ lies on $BC$.

How many integers $n \geq 2$ are there such that whenever $z_1, z_2, ..., z_n$ are complex numbers such that $$|z_1| = |z_2| = ... = |z_n| = 1 \text{ and } z_1 + z_2 + ... + z_n = 0,$$ then the numbers $z_1, z_2, ..., z_n$ are equally spaced on the unit circle in the complex plane? $\textbf{(A)}\ 1 \qquad\textbf{(B)}\ 2 \qquad\textbf{(C)}\ 3 \qquad\textbf{(D)}\ 4 \qquad\textbf{(E)}\ 5$

There are $6$ pieces of cheese of different weights. For any two pieces we can identify the heavier piece. Given that it is possible to divide them into two groups of equal weights with three pieces in each. Give the explicit way to find these groups by performing two weightings on a regular balance.

Let $P$ be a convex polygon. Prove that there exists a convex hexagon that is contained in $P$ and whose area is at least $\frac34$ of the area of the polygon $P$. [i]Alternative version.[/i] Let $P$ be a convex polygon with $n\geq 6$ vertices. Prove that there exists a convex hexagon with [b]a)[/b] vertices on the sides of the polygon (or) [b]b)[/b] vertices among the vertices of the polygon such that the area of the hexagon is at least $\frac{3}{4}$ of the area of the polygon. [i]Proposed by Ben Green and Edward Crane, United Kingdom[/i]

The Euclidian three-dimensional space has been partitioned into three nonempty sets $A_1,A_2,A_3$. Show that one of these sets contains, for each $d > 0$, a pair of points at mutual distance $d$.

Let $\omega_P$ and $\omega_Q$ be two circles of radius $1$, intersecting in points $A$ and $B$. Let $P$ and $Q$ be two regular $n$-gons (for some positive integer $n\ge4$) inscribed in $\omega_P$ and $\omega_Q$, respectively, such that $A$ and $B$ are vertices of both $P$ and $Q$. Suppose a third circle $\omega$ of radius $1$ intersects $P$ at two of its vertices $C$, $D$ and intersects $Q$ at two of its vertices $E$, $F$. Further assume that $A$, $B$, $C$, $D$, $E$, $F$ are all distinct points, that $A$ lies outside of $\omega$, and that $B$ lies inside $\omega$. Show that there exists a regular $2n$-gon that contains $C$, $D$, $E$, $F$ as four of its vertices.

Determine the number of integers $ n$ with $ 1 \le n \le N\equal{}1990^{1990}$ such that $ n^2\minus{}1$ and $ N$ are coprime.

On a sphere with radius $1$, a point $ P $ is given. Three mutually perpendicular the rays emanating from the point $ P $ intersect the sphere at the points $ A $, $ B $ and $ C $. Prove that all such possible $ ABC $ planes pass through fixed point, and find the maximum possible area of the triangle $ ABC $

Let $ABCDEFGH$ be a regular octagon with side length $\sqrt{60}$. Let $\mathcal{K}$ denote the locus of all points $K$ such that the circumcircles (possibly degenerate) of triangles $HAK$ and $DCK$ are tangent. Find the area of the region that $\mathcal{K}$ encloses.

Thomas and Nils are playing a game. They have a number of cards, numbered $1, 2, 3$, et cetera. At the start, all cards are lying face up on the table. They take alternate turns. The person whose turn it is, chooses a card that is still lying on the table and decides to either keep the card himself or to give it to the other player. When all cards are gone, each of them calculates the sum of the numbers on his own cards. If the difference between these two outcomes is divisible by $3$, then Thomas wins. If not, then Nils wins. (a) Suppose they are playing with $2018$ cards (numbered from $1$ to $2018$) and that Thomas starts. Prove that Nils can play in such a way that he will win the game with certainty. (b) Suppose they are playing with $2020 $cards (numbered from $1$ to $2020$) and that Nils starts. Which of the two players can play in such a way that he wins with certainty?