Find all square numbers $ S_1$ and $ S_2$ such that $ S_1 \minus{} S_2 \equal{} 1989.$

Let $p$ and $q$ be two given positive integers. A set of $p+q$ real numbers $a_1<a_2<\cdots <a_{p+q}$ is said to be balanced iff $a_1,\ldots,a_p$ were an arithmetic progression with common difference $q$ and $a_p,\ldots,a_{p+q}$ where an arithmetic progression with common difference $p$. Find the maximum possible number of balanced sets, so that any two of them have nonempty intersection. Comment: The intended problem also had "$p$ and $q$ are coprime" in the hypothesis. A typo when the problems where written made it appear like that in the exam (as if it were the only typo in the olympiad). Fortunately, the problem can be solved even if we didn't suppose that and it can be further generalized: we may suppose that a balanced set has $m+n$ reals $a_1<\cdots <a_{m+n-1}$ so that $a_1,\ldots,a_m$ is an arithmetic progression with common difference $p$ and $a_m,\ldots,a_{m+n-1}$ is an arithmetic progression with common difference $q$.

Equations of non-intersecting curves are $y = ax^2 + bx + c$ and $y = dx^2 + ex + f$ where $ad < 0.$ Prove that there is a line of the plane which does not meet either of the curves.

What is the least value of $(x-1)(x-2)(x-3)(x-4)$ where $x$ is a real number? $ \textbf{(A)}\ -\dfrac 14 \qquad\textbf{(B)}\ - \dfrac 13 \qquad\textbf{(C)}\ -\dfrac 12 \qquad\textbf{(D)}\ -1 \qquad\textbf{(E)}\ -2 $

[b]1.[/b] Given a positive integer $r>1$, prove that there exists an infinite number of infinite geometrical series, with positive terms, having the sum 1 and satisfying the following condition: for any positive real numbers $S_{1},S_{2},\dots,S_{r}$ such that $S_{1}+S_{2}+\dots+S_{r}=1$, any of these infinite geometrical series can be divided into $r$ infinite series(not necessarily geometrical) having the sums $S_{1},S_{2},\dots,S_{r}$, respectively. [b](S. 6)[/b]

Find all functions $f: R \to R$, such that equality $f (xf (y) - yf (x)) = f (xy) - xy$ holds for all $x, y \in R$.

Let there be three cups $A, B$ and $C$, which start with $a, b$ and $c$ (all of them are natural numbers) units of gallium filled. It is also believed that all cups are large enough to contain the total amount of gallium available. It is now allowed to move gallium from one cup to another cup, provided that the contents of the latter cup are exactly double. (a) For which starting positions is it possible to empty one of the cups? (b) For which starting positions is it possible to put all of the gallium in one cup?

In an acute-angled triangle ABC, points $A_2$, $B_2$, $C_2$ are the midpoints of the altitudes $AA_1$, $BB_1$, $CC_1$, respectively. Compute the sum of angles $B_2A_1C_2$, $C_2B_1A_2$ and $A_2C_1B_2$. [i]D. Tereshin[/i]

Consider the collection of all three-element subsets drawn from the set $ \{1,2,3,4,\dots,299,300\}$. Determine the number of those subsets for which the sum of the elements is a multiple of 3.

For a multiple of $ kb$ of $ b$ let $ a \% kb$ be the greatest number such that $ a \% kb \equal{} a \bmod b$ which is smaller than $ kb$ and not greater than $ a$ itself. Let $ n \in \mathbb{Z}^ \plus{} .$ Determine all integer pairs $ (a,b)$ with: \[ a\%b \plus{} a\%2b \plus{} a\%3b \plus{} \ldots \plus{} a\%nb \equal{} a \plus{} b \]

For what real values of $x$ is \[ \sqrt{x+\sqrt{2x-1}}+\sqrt{x-\sqrt{2x-1}}=A \] given a) $A=\sqrt{2}$; b) $A=1$; c) $A=2$, where only non-negative real numbers are admitted for square roots?

Suppose that $O$ is a point inside a convex quadrilateral $ABCD$ such that \[ OA^2 + OB^2 + OC^2 + OD^2 = 2\mathcal A[ABCD] , \] where by $\mathcal A[ABCD]$ we have denoted the area of $ABCD$. Prove that $ABCD$ is a square and $O$ is its center. [i]Yugoslavia[/i]

Given a triangle $ABC$, let $D$ be the point where the incircle of the triangle $ABC$ touches the side $BC$. A circle through the vertices $B$ and $C$ is tangent to the incircle of triangle $ABC$ at the point $E$. Show that the line $DE$ passes through the excentre of triangle $ABC$ corresponding to vertex $A$.

How many positive integers $ N$ less than $ 1000$ are there such that the equation $ x^{\lfloor x\rfloor} \equal{} N$ has a solution for $ x$? (The notation $ \lfloor x\rfloor$ denotes the greatest integer that is less than or equal to $ x$.)

Let $n$ be a positive integer. Let $T_n$ be a set of positive integers such that: \[{T_n={ \{11(k+h)+10(n^k+n^h)| (1 \leq k,h \leq 10)}}\}\] Find all $n$ for which there don't exist two distinct positive integers $a, b \in T_n$ such that $a\equiv b \pmod{110}$

Given $n \ (n \geq 3)$ points in space such that every three of them form a triangle with one angle greater than or equal to $120^\circ$, prove that these points can be denoted by $A_1,A_2, \ldots,A_n$ in such a way that for each $i, j, k, 1 \leq i < j < k \leq n$, angle $A_iA_jA_k$ is greater than or equal to $120^\circ . $

A number of linked rings, each 1 cm thick, are hanging on a peg. The top ring has an outside diameter of 20 cm. The outside diameter of each of the outer rings is 1 cm less than that of the ring above it. The bottom ring has an outside diameter of 3 cm. What is the distance, in cm, from the top of the top ring to the bottom of the bottom ring? [asy] size(200); defaultpen(linewidth(3)); real[] inrad = {40,34,28,21}; real[] outrad = {55,49,37,30}; real[] center; path[][] quad = new path[4][4]; center[0] = 0; for(int i=0;i<=3;i=i+1) { if(i != 0) { center[i] = center[i-1] - inrad[i-1] - inrad[i]+3.5; } quad[0][i] = arc((0,center[i]),inrad[i],0,90)--arc((0,center[i]),outrad[i],90,0)--cycle; quad[1][i] = arc((0,center[i]),inrad[i],90,180)--arc((0,center[i]),outrad[i],180,90)--cycle; quad[2][i] = arc((0,center[i]),inrad[i],180,270)--arc((0,center[i]),outrad[i],270,180)--cycle; quad[3][i] = arc((0,center[i]),inrad[i],270,360)--arc((0,center[i]),outrad[i],360,270)--cycle; draw(circle((0,center[i]),inrad[i])^^circle((0,center[i]),outrad[i])); } void fillring(int i,int j) { if ((j % 2) == 0) { fill(quad[i][j],white); } else { filldraw(quad[i][j],black); } } for(int i=0;i<=3;i=i+1) { for(int j=0;j<=3;j=j+1) { fillring(((2-i) % 4),j); } } for(int k=0;k<=2;k=k+1) { filldraw(circle((0,-228 - 25 * k),3),black); } real r = 130, s = -90; draw((0,57)--(r,57)^^(0,-57)--(r,-57),linewidth(0.7)); draw((2*r/3,56)--(2*r/3,-56),linewidth(0.7),Arrows(size=3)); label("$20$",(2*r/3,-10),E); draw((0,39)--(s,39)^^(0,-39)--(s,-39),linewidth(0.7)); draw((9*s/10,38)--(9*s/10,-38),linewidth(0.7),Arrows(size=3)); label("$18$",(9*s/10,0),W); [/asy] $ \textbf{(A) } 171\qquad \textbf{(B) } 173\qquad \textbf{(C) } 182\qquad \textbf{(D) } 188\qquad \textbf{(E) } 210$

$ABCD$ is a quadrilateral with a circumcircle centre $O$ and an inscribed circle centre $I$. The diagonals intersect at $S$. Show that if two of $O,I,S$ coincide, then it must be a square.

Let $X$ and $Y$ be two sets of points in the plane and $M$ be a set of segments connecting points from $X$ and $Y$ . Let $k$ be a natural number. Prove that the segments from $M$ can be painted using $k$ colors in such a way that for any point $x \in X \cup Y$ and two colors $\alpha$ and $\beta$ $(\alpha \neq \beta)$, the difference between the number of $\alpha$-colored segments and the number of $\beta$-colored segments originating in $X$ is less than or equal to $1$.

Consider a polynomial $P(x) = x^4+x^3-3x^2+x+2$. Prove that at least one of the coefficients of $(P(x))^k$, ($k$ is any positive integer) is negative. (5)

Positive real numbers $x,y$ satisfy $$\left \lfloor xy \right \rfloor - \lfloor x \rfloor \lfloor y \rfloor = 8.$$ Find the sum of all possible values of the quantity $\left \lfloor 2xy \right \rfloor - \lfloor 2x \rfloor \lfloor y \rfloor.$

A Retired Linguist (R.L.) writes in the first move a word consisting of $n$ letters, which are all different. In each move, he determines the maximum $i$, such that the word obtained by reversing the first $i$ letters of the last word hasn't been written before, and writes this new word. Prove that R.L. can make $n!$ moves.

$f(x)=\sum\limits_{i=1}^{2013}\left[\dfrac{x}{i!}\right]$. A integer $n$ is called [i]good[/i] if $f(x)=n$ has real root. How many good numbers are in $\{1,3,5,\dotsc,2013\}$?

[list] [*] A test was conducted in class. It is known that at least $\frac{2}{3}$ of the problems were hard. Each such problems were not solved by at least $\frac{2}{3}$ of the students. It is also known that at least $\frac{2}{3}$ of the students passed the test. Each such student solved at least $\frac{2}{3}$ of the suggested problems. Is this possible? [*] Previous problem with $\frac{2}{3}$ replaced by $\frac{3}{4}$. [*] Previous problem with $\frac{2}{3}$ replaced by $\frac{7}{10}$.[/list]

Find all integers $n$ for which $(n-1)\cdot 2^n + 1$ is a perfect square.