Let $C_1$ and $C_2$ be two concentric circles in the plane with radii $R$ and $3R$ respectively. Show that the orthocenter of any triangle inscribed in circle $C_1$ lies in the interior of circle $C_2$. Conversely, show that every point in the interior of $C_2$ is the orthocenter of some triangle inscribed in $C_1$.

Let $n$ be a positive integer. What is the largest $k$ for which there exist $n\times n$ matrices $M_1,\dots,M_k$ and $N_1,\dots,N_k$ with real entries such that for all $i$ and $j,$ the matrix product $M_iN_j$ has a zero entry somewhere on its diagonal if and only if $i\ne j?$

Let $v_1,v_2,\ldots,v_n$ vectors in $\mathbb{R}^2$ such that $|v_i|\leq 1$ for $1 \leq i \leq n$ and $\sum_{i=1}^n v_i=0$. Prove that there exists a permutation $\sigma$ of $(1,2,\ldots,n)$ such that $\left|\sum_{j=1}^k v_{\sigma(j)}\right| \leq\sqrt 5$ for every $k$, $1\leq k \leq n$. [i]Remark[/i]: If $v = (x,y)\in \mathbb{R}^2$, $|v| = \sqrt{x^2 + y^2}$.

Let $A$ be an $n\times n$ matrix with strictly positive elements and two vectors $u,v\in\mathbb{R}^n$, also with strictly positive elements, such that $$Au=v\text{ and }Av=u.$$ Prove that $u=v$.

Find the parallel displacement of a vector pointing north at Leningrad (latitude $60^{\circ}$) from west to east along a closed parallel.

$ \Delta_1,\ldots,\Delta_n$ are $ n$ concurrent segments (their lines concur) in the real plane. Prove that if for every three of them there is a line intersecting these three segments, then there is a line that intersects all of the segments.

Let $AA_1,BB_1,CC_1$ be the altitudes of a triangle $ABC$. If $\overrightarrow{AA_1}+\overrightarrow{BB_1}+\overrightarrow{CC_1}=0$ prove that the triangle $ABC$ is equilateral.

Let $ H$ be an arbitrary subgroup of the diffeomorphism group $ \mathsf{Diff}^\infty(M)$ of a differentiable manifold $ M$. We say that an $ \mathcal C^\infty$-vector field $ X$ is [i]weakly tangent[/i] to the group $ H$, if there exists a positive integer $ k$ and a $ \mathcal C^\infty$-differentiable map $ \varphi \mathrel{: } \mathord{]} \minus{} \varepsilon,\varepsilon\mathord{[}^k\times M\to M$ such that (i) for fixed $ t_1,\dots,t_k$ the map \[ \varphi_{t_1,\dots,t_k} : x\in M\mapsto \varphi(t_1,\dots,t_k,x)\] is a diffeomorphism of $ M$, and $ \varphi_{t_1,\dots,t_k}\in H$; (ii) $ \varphi_{t_1,\dots,t_k}\in H \equal{} \mathsf{Id}$ whenever $ t_j \equal{} 0$ for some $ 1\leq j\leq k$; (iii) for any $ \mathcal C^\infty$-function $ f: M\to \mathbb R$ \[ X f \equal{} \left.\frac {\partial^k(f\circ\varphi_{t_1,\dots,t_k})}{\partial t_1\dots\partial t_k}\right|_{(t_1,\dots,t_k) \equal{} (0,\dots,0)}.\] Prove, that the commutators of $ \mathcal C^\infty$-vector fields that are weakly tangent to $ H\subset \textsf{Diff}^\infty(M)$ are also weakly tangent to $ H$.

For an integer $n\geq 3$, let $\theta=2\pi/n$. Evaluate the determinant of the $n\times n$ matrix $I+A$, where $I$ is the $n\times n$ identity matrix and $A=(a_{jk})$ has entries $a_{jk}=\cos(j\theta+k\theta)$ for all $j,k$.

Let $n$ be a positive integer, set $S_n = \{ (a_1,a_2,\cdots,a_{2^n}) \mid a_i=0 \ \text{or} \ 1, 1 \leq i \leq 2^n\}$. For any two elements $a=(a_1,a_2,\cdots,a_{2^n})$ and $b=(b_1,b_2,\cdots,b_{2^n})$ of $S_n$, define \[ d(a,b)= \sum_{i=1}^{2^n} |a_i - b_i| \] We call $A \subseteq S_n$ a $\textsl{Good Subset}$ if $d(a,b) \geq 2^{n-1}$ holds for any two distinct elements $a$ and $b$ of $A$. How many elements can the $\textsl{Good Subset}$ of $S_n$ at most have?

Let $n\ge 2$ be a positive integer. Let $x_1, x_2, \dots, x_n$ be non-zero real numbers satisfying the equation \[\left(x_1+\frac{1}{x_2}\right)\left(x_2+\frac{1}{x_3}\right)\dots\left(x_n+\frac{1}{x_1}\right)=\left(x_1^2+\frac{1}{x_2^2}\right)\left(x_2^2+\frac{1}{x_3^2}\right)\dots\left(x_n^2+\frac{1}{x_1^2}\right).\] Find all possible values of $x_1, x_2, \dots, x_n$. [i]Proposed by Victor Domínguez[/i]

Let $n\geq 2$ be an integer and denote by $H_{n}$ the set of column vectors $^{T}(x_{1},\ x_{2},\ \ldots, x_{n})\in\mathbb{R}^{n}$, such that $\sum |x_{i}|=1$. Prove that there exist only a finite number of matrices $A\in\mathcal{M}_{n}(\mathbb{R})$ such that the linear map $f: \mathbb{R}^{n}\rightarrow\mathbb{R}^{n}$ given by $f(x)=Ax$ has the property $f(H_{n})=H_{n}$. [hide="Comment"]In the contest, the problem was given with a) and b): a) Prove the above for $n=2$; b) Prove the above for $n\geq 3$ as well.[/hide]

There are $n$ people standing on a circular track. We want to perform a number of [i]moves[/i] so that we end up with a situation where the distance between every two neighbours is the same. The [i]move[/i] that is allowed consists in selecting two people and asking one of them to walk a distance $d$ on the circular track clockwise, and asking the other to walk the same distance on the track anticlockwise. The two people selected and the quantity $d$ can vary from move to move. Prove that it is possible to reach the desired situation (where the distance between every two neighbours is the same) after at most $n-1$ moves.

Distinct points $A, B , C, D, E$ are given in this order on a semicircle with radius $1$. Prove that \[AB^{2}+BC^{2}+CD^{2}+DE^{2}+AB \cdot BC \cdot CD+BC \cdot CD \cdot DE < 4.\]

$ABC$ is a triangle with $\angle{B}>45^{\circ}$ , $\angle{C}>45^{\circ}$. We draw the isosceles triangles $CAM,BAN$ on the sides $AC,AB$ and outside the triangle, respectively, such that $\angle{CAM}=\angle{BAN}=90^{\circ}$. And we draw isosceles triangle $BPC$ on the side $BC$ and inside the triangle such that $\angle{BPC}=90^{\circ}$. Prove that $\Delta{MPN}$ is an isosceles triangle, too, and $\angle{MPN}=90^{\circ}$.

Given a triangle $ ABC$. Let $ G$, $ I$, $ H$ be the centroid, the incenter and the orthocenter of triangle $ ABC$, respectively. Prove that $ \angle GIH > 90^{\circ}$.

There are $ n \plus{} 1$ cells in a row labeled from $ 0$ to $ n$ and $ n \plus{} 1$ cards labeled from $ 0$ to $ n$. The cards are arbitrarily placed in the cells, one per cell. The objective is to get card $ i$ into cell $ i$ for each $ i$. The allowed move is to find the smallest $ h$ such that cell $ h$ has a card with a label $ k > h$, pick up that card, slide the cards in cells $ h \plus{} 1$, $ h \plus{} 2$, ... , $ k$ one cell to the left and to place card $ k$ in cell $ k$. Show that at most $ 2^n \minus{} 1$ moves are required to get every card into the correct cell and that there is a unique starting position which requires $ 2^n \minus{} 1$ moves. [For example, if $ n \equal{} 2$ and the initial position is 210, then we get 102, then 012, a total of 2 moves.]

There are $n > 1$ points on the plane. Two take turns connecting more an unconnected pair of points by a vector of one of two possible directions. If after the next move of a player the sum of all drawn vectors is zero, then the second one wins; if it's another move is impossible, and there was no zero sum, then the first one wins. Who wins when played correctly?

Suppose that $a, b, c$ are real numbers such that for all positive numbers $x_1,x_2,\dots,x_n$ we have $(\frac{1}{n}\sum_{i=1}^nx_i)^a(\frac{1}{n}\sum_{i=1}^nx_i^2)^b(\frac{1}{n}\sum_{i=1}^nx_i^3)^c\ge 1$ Prove that vector $(a, b, c)$ is a nonnegative linear combination of vectors $(-2,1,0)$ and $(-1,2,-1)$.

Show that for any vectors $a, b$ in Euclidean space, \[|a \times b|^3 \leq \frac{3 \sqrt 3}{8} |a|^2 |b|^2 |a-b|^2\] Remark. Here $\times$ denotes the vector product.

Prove that these two statements are equivalent for an $n$ dimensional vector space $V$: [b]$\cdot$[/b] For the linear transformation $T:V\longrightarrow V$ there exists a base for $V$ such that the representation of $T$ in that base is an upper triangular matrix. [b]$\cdot$[/b] There exist subspaces $\{0\}\subsetneq V_1 \subsetneq ...\subsetneq V_{n-1}\subsetneq V$ such that for all $i$, $T(V_i)\subseteq V_i$.

Let $ v_1, v_2, \ldots, v_{1989}$ be a set of coplanar vectors with $ |v_r| \leq 1$ for $ 1 \leq r \leq 1989.$ Show that it is possible to find $ \epsilon_r$, $1 \leq r \leq 1989,$ each equal to $ \pm 1,$ such that \[ \left | \sum^{1989}_{r\equal{}1} \epsilon_r v_r \right | \leq \sqrt{3}.\]

Let $ u_1, u_2, \ldots, u_m$ be $ m$ vectors in the plane, each of length $ \leq 1,$ with zero sum. Show that one can arrange $ u_1, u_2, \ldots, u_m$ as a sequence $ v_1, v_2, \ldots, v_m$ such that each partial sum $ v_1, v_1 \plus{} v_2, v_1 \plus{} v_2 \plus{} v_3, \ldots, v_1, v_2, \ldots, v_m$ has length less than or equal to $ \sqrt {5}.$

Find the index of the singular point $0$ of the vector field \[(xy+yz+xz)\]

A set $ E$ of points in the 3D space let $ L(E)$ denote the set of all those points which lie on lines composed of two distinct points of $ E.$ Let $ T$ denote the set of all vertices of a regular tetrahedron. Which points are in the set $ L(L(T))?$