On the cartesian plane are drawn several rectangles with the sides parallel to the coordinate axes. Assume that any two rectangles can be cut by a vertical or a horizontal line. Show that it's possible to draw one horizontal and one vertical line such that each rectangle is cut by at least one of these two lines.

Prove that for an arbitrary pair of vectors $f$ and $g$ in the space the inequality \[af^2 + bfg +cg^2 \geq 0\] holds if and only if the following conditions are fulfilled: \[a \geq 0, \quad c \geq 0, \quad 4ac \geq b^2.\]

Let $S=\{a_1,a_2,\ldots,a_n\}$ of nenul vectors in a plane. Show that $S{}$ can be partitioned in nenul subsets $B_1, B_2,\ldots, B_m$ with the properties: 1) each vector from $S{}$ is part of only on subset; 2) if $a_i\in B_j$ then the angle between vectors $a_i$ and $c_j$, which is the sum of all vectors from $B_j$ is not greater than $\frac{\pi}{2}$; 3) if $i\neq j$ then the angle between vectors $c_i$ and $c_j$, which is the sum of all vectors from $B_i$ and $B_j$, respectively, is greater than $\frac{\pi}{2}$. What are the possible values of $m$?

Given vectors $\overline a,\overline b,\overline c\in\mathbb R^n$, show that $$(\lVert\overline a\rVert\langle\overline b,\overline c\rangle)^2+(\lVert\overline b\rVert\langle\overline a,\overline c\rangle)^2\le\lVert\overline a\rVert\lVert\overline b\rVert(\lVert\overline a\rVert\lVert\overline b\rVert+|\langle\overline a,\overline b\rangle|)\lVert\overline c\rVert^2$$where $\langle\overline x,\overline y\rangle$ denotes the scalar (inner) product of the vectors $\overline x$ and $\overline y$ and $\lVert\overline x\rVert^2=\langle\overline x,\overline x\rangle$.

Given an $n \times n$ ($n \ge 3$) square table with one of the following unit vectors $\uparrow, \downarrow, \leftarrow, \rightarrow$ in any its cell (the vectors are parallel to the sides and the middles of them coincide with the centers of the cells). Per move a beetle creeps from one cell to another in accordance with the vector’s direction. If the beetle starts from any cell, then it comes back to this cell after some number of moves. The vectors are directed so that they do not allow the beetle to leave the table. Is it possible that the sum of all vectors at any row (except for the first one and the last one) is equal to the vector that is parallel to this row, and the sum of all vectors at any column (except for the first one and the last one) is equal to the vector that is parallel to this column ? (D. Dudko)

Given two integers $m,n$ which are greater than $1$. $r,s$ are two given positive real numbers such that $r<s$. For all $a_{ij}\ge 0$ which are not all zeroes,find the maximal value of the expression \[f=\frac{(\sum_{j=1}^{n}(\sum_{i=1}^{m}a_{ij}^s)^{\frac{r}{s}})^{\frac{1}{r}}}{(\sum_{i=1}^{m})\sum_{j=1}^{n}a_{ij}^r)^{\frac{s}{r}})^{\frac{1}{s}}}.\]

Some points with the integer coordinates are marked on the coordinate plane. Given a set of nonzero vectors. It is known, that if you apply the beginnings of those vectors to the arbitrary marked point, than there will be more marked ends of the vectors, than not marked. Prove that there is infinite number of marked points.

A finite set $V \in Z^2$ of vectors with integer coordinates is chosen on the plane. Each of them is painted one of the $n$ colors. The color is [i]suitable[/i] for the vector if this vector may be presented as' a linear combination (with integer coefficients) of the vectors from $V$ of this color. It is known,that for any vector from $Z^2$ there exist a suitable color. Find all $n$ such that there must exist a color which is suitable for any vector from $Z^2$ . (V. Lebed)

Given that $a,b,c,d,e$ are real numbers such that $a+b+c+d+e=8$, $a^2+b^2+c^2+d^2+e^2=16$. Determine the maximum value of $e$.

Let $V$ be the set of non-collinear pairs of vectors in $\mathbb{R}^3$, and $H$ be the set of lines passing through the origin. Is is true that for every continuous map $f\colon V\rightarrow H$ there exists a continuous map $g\colon V\rightarrow \mathbb{R}^3\,\backslash\,\{ 0\}$ such that $g(v)\in f(v)$ for all $v\in V$? (translated by Miklós Maróti)

Triangles $ ABC$ and $ ADE$ have areas $ 2007$ and $ 7002,$ respectively, with $ B \equal{} (0,0),$ $ C \equal{} (223,0),$ $ D \equal{} (680,380),$ and $ E \equal{} (689,389).$ What is the sum of all possible x-coordinates of $ A?$ $ \textbf{(A)}\ 282 \qquad \textbf{(B)}\ 300 \qquad \textbf{(C)}\ 600 \qquad \textbf{(D)}\ 900 \qquad \textbf{(E)}\ 1200$

The [i]cross[/i] of a convex $n$-gon is the quadratic mean of the lengths between the possible pairs of vertices. For example, the cross of a $3 \times 4$ rectangle is $\sqrt{ \dfrac{3^2 + 3^2 + 4^2 + 4^2 + 5^2 + 5^2}{6} } = \dfrac{5}{3} \sqrt{6}$. Suppose $S$ is a dodecagon ($12$-gon) inscribed in a unit circle. Find the greatest possible cross of $S$.

Consider a Riemannian metric on the vector space ${\Bbb{R}^n}$ which satisfies the property that for each two points ${a,b}$ there is a single distance minimising geodesic segment ${g(a,b)}$. Suppose that for all ${a \in \Bbb{R}^n}$, the Riemannian distance with respect to ${a}, {\rho_a : \Bbb{R}^n \rightarrow \Bbb{R}}$ is convex and differentiable outside of ${a}$. Prove that if for a point ${x \neq a,b}$ we have \[ \displaystyle \partial_i \rho_a(x)=-\partial_i \rho_b(x),\ i=1,\cdots, n\] then ${x}$ is a point on ${g(a,b)}$ and conversely. [i]Proposed by Lajos Tamássy and Dávid Kertész[/i]

Let $O$ be the centre of a regular $n$-gon whose vertices are labelled $A_1$,$...$, $A_n$. Let $a_1>a_2>...>a_n>0$. Prove that the vector $$a_1\overrightarrow{OA_1}+a_2\overrightarrow{OA_2}+...+a_n\overrightarrow{OA_n}$$ is not equal to the zero vector. (D. Fomin, Alexey Kirichenko)

A country has $n$ cities, labelled $1,2,3,\dots,n$. It wants to build exactly $n-1$ roads between certain pairs of cities so that every city is reachable from every other city via some sequence of roads. However, it is not permitted to put roads between pairs of cities that have labels differing by exactly $1$, and it is also not permitted to put a road between cities $1$ and $n$. Let $T_n$ be the total number of possible ways to build these roads. (a) For all odd $n$, prove that $T_n$ is divisible by $n$. (b) For all even $n$, prove that $T_n$ is divisible by $n/2$.

A [i]$n$-trønder walk[/i] is a walk starting at $(0, 0)$, ending at $(2n, 0)$ with no self intersection and not leaving the first quadrant, where every step is one of the vectors $(1, 1)$, $(1, -1)$ or $(-1, 1)$. Find the number of $n$-trønder walks.

On the sides $ AB,BC,CD,DA $ of the parallelogram $ ABCD, $ consider the points $ M,N,P, $ respectively, $ Q, $ such that $ \overrightarrow{MN} +\overrightarrow{QP} =\overrightarrow{AC} . $ Show that $ \overrightarrow{PN} +\overrightarrow{QM} = \overrightarrow{DB} . $

Let $I$ be the incenter of the non-isosceles triangle $ABC$ and let $A',B',C'$ be the tangency points of the incircle with the sides $BC,CA,AB$ respectively. The lines $AA'$ and $BB'$ intersect in $P$, the lines $AC$ and $A'C'$ in $M$ and the lines $B'C'$ and $BC$ intersect in $N$. Prove that the lines $IP$ and $MN$ are perpendicular. [i]Alternative formulation.[/i] The incircle of a non-isosceles triangle $ABC$ has center $I$ and touches the sides $BC$, $CA$ and $AB$ in $A^{\prime}$, $B^{\prime}$ and $C^{\prime}$, respectively. The lines $AA^{\prime}$ and $BB^{\prime}$ intersect in $P$, the lines $AC$ and $A^{\prime}C^{\prime}$ intersect in $M$, and the lines $BC$ and $B^{\prime}C^{\prime}$ intersect in $N$. Prove that the lines $IP$ and $MN$ are perpendicular.

Let $ x_1,x_2,..,x_n$ be non-negative numbers whose sum is $ 1$ . Show that there exist numbers $ a_1,a_2,\ldots ,a_n$ chosen from amongst $ 0,1,2,3,4$ such that $ a_1,a_2,\ldots ,a_n$ are different from $ 2,2,\ldots ,2$ and $ 2\leq a_1x_1\plus{}a_2x_2\plus{}\ldots\plus{}a_nx_n\leq 2\plus{}\frac{2}{3^n\minus{}1}$.

Given some points in the plane. For some pairs $A,B$ the vector $AB$ is chosen. For every point the number of the chosen vectors starting in that point equal to the number of the chosen vectors ending in that point. Prove that the sum of the chosen vectors equals to zero vector.

Let $ \mathcal{H}$ be an infinite-dimensional Hilbert space, let $ d>0$, and suppose that $ S$ is a set of points (not necessarily countable) in $ \mathcal{H}$ such that the distance between any two distinct points in $ S$ is equal to $ d$. Show that there is a point $ y\in\mathcal{H}$ such that \[ \left\{\frac{\sqrt{2}}{d}(x\minus{}y): \ x\in S\right\}\] is an orthonormal system of vectors in $ \mathcal{H}$.

Let $ABC$ be a triangle with orthocenter $H$ and let $P$ be the second intersection of the circumcircle of triangle $AHC$ with the internal bisector of the angle $\angle BAC$. Let $X$ be the circumcenter of triangle $APB$ and $Y$ the orthocenter of triangle $APC$. Prove that the length of segment $XY$ is equal to the circumradius of triangle $ABC$.

In a triangle $ABC$, let $D$ and $E$ be the midpoints of $AC$ and $BC$ respectively. The distance from the midpoint of $BD$ to the midpoint of $AE$ is $4.5$. What is the length of side $AB$?

We are given a lattice and two pebbles $A$ and $B$ that are placed at two lattice points. At each step we are allowed to relocate one of the pebbles to another lattice point with the condition that the distance between pebbles is preserved. Is it possible after finite number of steps to switch positions of the pebbles?

Let $n$ be a positive integer and let $V$ be a $(2n-1)$-dimensional vector space over the two-element field. Prove that for arbitrary vectors $v_1,\dots,v_{4n-1} \in V,$ there exists a sequence $1\leq i_1<\dots<i_{2n}\leq 4n-1$ of indices such that $v_{i_1}+\dots+v_{i_{2n}}=0.$