a) Find two sets $X,Y$ such that $X\cap Y =\emptyset$, $X\cup Y = \mathbb Q^{\star}_{+}$ and $Y = \{a\cdot b \mid a,b \in X \}$. b) Find two sets $U,V$ such that $U\cap V =\emptyset$, $U\cup V = \mathbb R$ and $V = \{x+y \mid x,y \in U \}$.

Let $ S(t)$ be the area of the traingle $ OAB$ with $ O(0,\ 0,\ 0),\ A(2,\ 2,\ 1),\ B(t,\ 1,\ 1 \plus{} t)$. Evaluate $ \int_1^ e S(t)^2\ln t\ dt$.

Given $X=\{0,a,b,c\}$, let $M(X)=\{f|f: X\to X\}$ denote the set of all functions from $X$ into itself. An addition table on $X$ is given us follows: $+$ $0$ $a$ $b$ $c$ $0$ $0$ $a$ $b$ $c$ $a$ $a$ $0$ $c$ $b$ $b$ $b$ $c$ $0$ $a$ $c$ $c$ $b$ $a$ $0$ a)If $S=\{f\in M(X)|f(x+y+x)=f(x)+f(y)+f(x)\forall x,y\in X\}$, find $|S|$. b)If $I=\{f\in M(X)|f(x+x)=f(x)+f(x)\forall x\in X\}$, find $|I|$.

Let $ n$ be an even number, and $ S$ be the set of all arrays of length $ n$ whose elements are from the set $ \left\{0,1\right\}$. Prove that $ S$ can be partitioned into disjoint three-element subsets such that for each three arrays $ \left(a_i\right)_{i \equal{} 1}^n$, $ \left(b_i\right)_{i \equal{} 1}^n$, $ \left(c_i\right)_{i \equal{} 1}^n$ which belong to the same subset and for each $ i\in\left\{1,2,...,n\right\}$, the number $ a_i \plus{} b_i \plus{} c_i$ is divisible by $ 2$.

Let a convex polygon $H$ be given. Show that for every real number $a \in (0, 1)$ there exist 6 distinct points on the sides of $H$, denoted by $A_1, A_2, \ldots, A_6$ clockwise, satisfying the conditions: [b]I.[/b] $(A_1A_2) = (A_5A_4) = a \cdot (A_6A_3)$. [b]II.[/b] Lines $A_1A_2, A_5A_4$ are equidistant from $A_6A_3$. (By $(AB)$ we denote vector $AB$)

Let P be an interior point of a regular n-gon $ A_1 A_2 ...A_n$, the lines $ A_i P$ meet the regular n-gon at another point $ B_i$, where $ i\equal{}1,2,...,n$. Prove that sums of all $ PA_i\geq$ sum of all $ PB_i$.

There are $ n$ points ($ n \geq 4$) on a sphere with radius $ R$, and not all of them lie on the same semi-sphere. Prove that among all the angles formed by any two of the $ n$ points and the sphere centre $ O$ ($ O$ is the vertex of the angle), there is at least one that is not less than $ \displaystyle 2 \arcsin{\frac{\sqrt{6}}{3}}$.

Let $m,n$ be positive integers with $m \ge n$. Let $S$ be the set of pairs $(a,b)$ of relatively prime positive integers such that $a,b \le m$ and $a+b > m$. For each pair $(a,b)\in S$, consider the nonnegative integer solution $(u,v)$ to the equation $au - bv = n$ chosen with $v \ge 0$ minimal, and let $I(a,b)$ denote the (open) interval $(v/a, u/b)$. Prove that $I(a,b) \subseteq (0,1)$ for every $(a,b)\in S$, and that any fixed irrational number $\alpha\in(0,1)$ lies in $I(a,b)$ for exactly $n$ distinct pairs $(a,b)\in S$. [i]Victor Wang, inspired by 2013 ISL N7[/i]

Several points are denoted on a white piece of paper. The distance between each two of the points is greater than $24$. A drop of ink was sprinkled over the paper covering an area smaller than $\pi$. Prove that there exists a vector $\overrightarrow v$ with $\overrightarrow v<1$, such that after translating all of the points by $v$ none of them is covered in ink.

Given a point $X$ and $n$ vectors $\overrightarrow{x_i}$ with sum zero in the plane. For each permutation of the vectors we form a set of $n$ points, by starting at $X$ and adding the vectors in order. For example, with the original ordering we get $X_1$ such that $XX_1 = \overrightarrow{x_1}, X_2$ such that $X_1X_2 = \overrightarrow{x_2}$ and so on. Show that for some permutation we can find two points $Y, Z$ with angle $\angle YXZ = 60^o $, so that all the points lie inside or on the triangle $XYZ$.

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.

[b]problem 5.[/b] Let $x_1, x_2,\ldots, x_k$ be vectors of $m$-dimensional Euclidean space, such that $x_1+x_2+\ldots + x_k=0$. Show that there exists a permutation $\pi$ of the integers $\{ 1, 2, \ldots, k \}$ such that: $$\left\lVert \sum_{i=1}^n x_{\pi (i)}\right\rVert \leq \left( \sum_{i=1}^k \lVert x_i \rVert ^2\right)^{1/2}$$for each $n=1, 2, \ldots, k$. Note that $\lVert \cdot \rVert$ denotes the Euclidean norm. (18 points).

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

Let $a_{ij}$ $i=1,2,3$; $j=1,2,3$ be real numbers such that $a_{ij}$ is positive for $i=j$ and negative for $i\neq j$. Prove the existence of positive real numbers $c_{1}$, $c_{2}$, $c_{3}$ such that the numbers \[a_{11}c_{1}+a_{12}c_{2}+a_{13}c_{3},\qquad a_{21}c_{1}+a_{22}c_{2}+a_{23}c_{3},\qquad a_{31}c_{1}+a_{32}c_{2}+a_{33}c_{3}\] are either all negative, all positive, or all zero. [i]Proposed by Kiran Kedlaya, USA[/i]

For every integer $n\ge 3$ find all sequences of real numbers $(x_1,x_2,\ldots ,x_n)$ such that $\sum_{i=1}^{n}x_i=n$ and $\sum_{i=1}^{n} (x_{i-1}-x_i+x_{i+1})^2=n$, where $x_0=x_n$ and $x_{n+1}=x_1$.

Let $n \geq 2$ be a positive integer and, for all vectors with integer entries $$X=\begin{pmatrix} x_1 \\ x_2 \\ \vdots \\ x_n \end{pmatrix}$$ let $\delta(X) \geq 0$ be the greatest common divisor of $x_1,x_2, \dots, x_n.$ Also, consider $A \in \mathcal{M}_n(\mathbb{Z}).$ Prove that the following statements are equivalent: $\textbf{i) }$ $|\det A | = 1$ $\textbf{ii) }$ $\delta(AX)=\delta(X),$ for all vectors $X \in \mathcal{M}_{n,1}(\mathbb{Z}).$ [i]Romeo Raicu[/i]

Let $z$ be a complex number such that $z,z^2,z^3$ are all collinear in the complex plane . Show that $z$ is a real number .

There are $ 16$ pupils in a class. Every month, the teacher divides the pupils into two groups. Find the smallest number of months after which it will be possible that every two pupils were in two different groups during at least one month.

Given the vector spaces $V,W$ with coefficients over a field $K$ and function $ \phi :V\to W$ satisfying the relation : $$\varphi(\lambda x+y)= \lambda \varphi(x)+\phi (y)$$ for all $x,y \in V, \lambda \in K$. Such a function is called linear. Let $L\varphi=\{x\in V/\varphi(x)=0\}$ , and$M=\varphi(V)$ , prove that : (i) $L\varphi$ is subspace of $V$ and $M$ is subspace of $W$ (ii) $L\varphi={O}$ iff $\varphi$ is $1-1$ (iii) Dimension of $V$ equals to dimension of $L\varphi$ plus dimension of $M$ (iv) If $\theta : \mathbb{R}^3\to\mathbb{R}^3$ with $\theta(x,y,z)=(2x-z,x-y,x-3y+z)$, prove that $\theta$ is linear function . Find $L\theta=\{x\in {R}^3/\theta(x)=0\}$ and dimension of $M=\theta({R}^3)$.

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}.\]

[asy] real t=pi/12;real u=8*t; real cu=cos(u);real su=sin(u); draw(unitcircle); draw((cos(-t),sin(-t))--(cos(13*t),sin(13*t))); draw((cu,su)--(cu,-su)); label("A",(cos(13*t),sin(13*t)),W); label("B",(cos(-t),sin(-t)),E); label("C",(cu,su),N); label("D",(cu,-su),S); label("E",(cu,sin(-t)),NE); label("2",((cu-1)/2,sin(-t)),N); label("6",((cu+1)/2,sin(-t)),N); label("3",(cu,(sin(-t)-su)/2),E); //Credit to Zimbalono for the diagram[/asy] Chords $AB$ and $CD$ in the circle above intersect at $E$ and are perpendicular to each other. If segments $AE$, $EB$, and $ED$ have measures $2$, $3$, and $6$ respectively, then the length of the diameter of the circle is $\textbf{(A) }4\sqrt{5}\qquad\textbf{(B) }\sqrt{65}\qquad\textbf{(C) }2\sqrt{17}\qquad\textbf{(D) }3\sqrt{7}\qquad \textbf{(E) }6\sqrt{2}$

Denote by $\mathbb{V}$ the real vector space of all real polynomials in one variable, and let $\gamma :\mathbb{V}\to \mathbb{R}$ be a linear map. Suppose that for all $f,g\in \mathbb{V}$ with $\gamma(fg)=0$ we have $\gamma(f)=0$ or $\gamma(g)=0$. Prove that there exist $c,x_0\in \mathbb{R}$ such that \[ \gamma(f)=cf(x_0)\quad \forall f\in \mathbb{V}\]

A rectangular array has $ n$ rows and $ 6$ columns, where $ n \geq 2$. In each cell there is written either $ 0$ or $ 1$. All rows in the array are different from each other. For each two rows $ (x_{1},x_{2},x_{3},x_{4},x_{5},x_{6})$ and $ (y_{1},y_{2},y_{3},y_{4},y_{5},y_{6})$, the row $ (x_{1}y_{1},x_{2}y_{2},x_{3}y_{3},x_{4}y_{4},x_{5}y_{5},x_{6}y_{6})$ can be found in the array as well. Prove that there is a column in which at least half of the entries are zeros.

We consider graphs with vertices colored black or white. "Switching" a vertex means: coloring it black if it was formerly white, and coloring it white if it was formerly black. Consider a finite graph with all vertices colored white. Now, we can do the following operation: Switch a vertex and simultaneously switch all of its neighbours (i. e. all vertices connected to this vertex by an edge). Can we, just by performing this operation several times, obtain a graph with all vertices colored black? [It is assumed that our graph has no loops (a [i]loop[/i] means an edge connecting one vertex with itself) and no multiple edges (a [i]multiple edge[/i] means a pair of vertices connected by more than one edge).]

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$.