RU-ALLRUSSIAN 1991

Find all integers a, b, c, d such that ab - 2cd = 3, ac + bd = 1.

n numbers are written on a blackboard. Someone then repeatedly erases two numbers and writes half their arithmetic mean instead, until only a single number remains. If all the original numbers were 1, show that the final number is not less than $1 / \mathrm{n}$ .

Four lines in the plane intersect in six points. Each line is thus divided into two segments and two rays. Is it possible for the eight segments to have lengths 1, 2, 3, ..., 8? Can the lengths of the eight segments be eight distinct integers?

Answer no, yes

A lottery ticket has 50 cells into which one must put a permutation of 1, 2, 3, ..., 50. Any ticket with at least one cell matching the winning permutation wins a prize. How many tickets are needed to be sure of winning a prize?

Answer 26

Find unequal integers m, n such that mn + n and mn + m are both squares. Can you find such integers between 988 and 1991?

Answer no

ABCD is a rectangle. Points K, L, M, N are chosen on AB, BC, CD, DA respectively so that KL is parallel to MN, and KM is perpendicular to LN. Show that the intersection of KM and LN lies on BD.

An investigator works out that he needs to ask at most 91 questions on the basis that all the answers will be yes or no and all will be true. The questions may depend upon the earlier answers. Show that he can make do with 105 questions if at most one answer could be a lie.

A minus sign is placed on one square of a $5 \mathrm{x} 5$ board and plus signs are placed on the remaining squares. A move is to select a $2 \mathrm{x} 2$ , $3 \mathrm{x} 3$ , $4 \mathrm{x} 4$ or $5 \mathrm{x} 5$ square and change all the signs in it. Which initial positions allow a series of moves to change all the signs to plus?

Answer only the central square

Show that $(\mathrm{x} + \mathrm{y} + \mathrm{z})^{2} / 3 \geq \mathrm{x}\sqrt{(\mathrm{y}\mathrm{z})} + \mathrm{y}\sqrt{(\mathrm{z}\mathrm{x})} + \mathrm{z}\sqrt{(\mathrm{x}\mathrm{y})}$ for all non- negative reals $\mathrm{x}, \mathrm{y}, \mathrm{z}$ .

Does there exist a triangle in which two sides are integer multiples of the median to that side? Does there exist a triangle in which every side is an integer multiple of the median to that side?

Answer yes, no

The numbers 1, 2, 3, ..., n are written on a blackboard (where $\mathrm{n} \geq 3$ ). A move is to replace two numbers by their sum and non- negative difference. A series of moves makes all the numbers equal k. Find all possible k.

Answer all powers of $2 \geq \mathrm{n}$

The figure below is cut along the lines into polygons (which need not be convex). No polygon contains a 2 x 2 square. What is the smallest possible number of polygons?

Answer 12

ABC is an acute- angled triangle with circumcenter O. The circumcircle of ABO intersects AC and BC at M and N. Show that the circumradii of ABO and MNC are the same.

A polygon can be transformed into a new polygon by making a straight cut, which creates two new pieces each with a new edge. One piece is then turned over and the two new edges are reattached. Can repeated transformations of this type turn a square into a triangle?

An $h \times k$ minor of an n x n table is the hk cells which lie in h rows and k columns. The semiperimeter of the minor is $\mathrm{h} + \mathrm{k}$ . A number of minors each with semiperimeter at least n together include all the cells on the main diagonal. Show that they include at least half the cells in the table.

(1) $\mathbf{r}_1, \mathbf{r}_2, \ldots , \mathbf{r}_{100}, \mathbf{c}_1, \mathbf{c}_2, \ldots , \mathbf{c}_{100}$ are distinct reals. The number $\mathbf{r}_i + \mathbf{c}_j$ is written in position i, j of a $100 \times 100$ array. The product of the numbers in each column is 1. Show that the product of the numbers in each row is -1. (2) $\mathbf{r}_1, \mathbf{r}_2, \ldots , \mathbf{r}_{2n}, \mathbf{c}_1, \mathbf{c}_2, \ldots , \mathbf{c}_{2n}$ are distinct reals. The number $\mathbf{r}_i + \mathbf{c}_j$ is written in position i, j of a $2n \times 2n$ array. The product of the numbers in each column is the same. Show that the product of the numbers in each row is also the same.

A sequence of positive integers is constructed as follows. If the last digit of $\mathbf{a}_{\mathrm{n}}$ is greater than 5, then $\mathbf{a}_{\mathrm{n} + 1}$ is $9\mathbf{a}_{\mathrm{n}}$ . If the last digit of $\mathbf{a}_{\mathrm{n}}$ is 5 or less and $\mathbf{a}_{\mathrm{n}}$ has more than one digit, then $\mathbf{a}_{\mathrm{n} + 1}$ is obtained from $\mathbf{a}_{\mathrm{n}}$ by deleting the last digit. If $\mathbf{a}_{\mathrm{n}}$ has only one digit, which is 5 or less, then the sequence terminates. Can we choose the first member of the sequence so that it does not terminate?

$\mathrm{p(x)}$ is the cubic $\mathrm{x}^3 - 3\mathrm{x}^2 +5\mathrm{x}$ . If h is a real root of $\mathrm{p(x)} = 1$ and k is a real root of $\mathrm{p(x)} = 5$ find $\mathrm{h} + \mathrm{k}$

The chords AB and CD of a sphere intersect at X. A, C and X are equidistant from a point Y on the sphere. Show that BD and XY are perpendicular.

Do there exist 4 vectors in the plane so that none is a multiple of another, but the sum of each pair is perpendicular to the sum of the other two? Do there exist 91 non- zero vectors in the plane such that the sum of any 19 is perpendicular to the sum of the others?

ABCD is a square. The points X on the side AB and Y on the side AD are such that AX·AY = 2 BX·DY. The lines CX and CY meet the diagonal BD in two points. Show that these points lie on the circumcircle of AXY.

X is a set with 100 members. What is the smallest number of subsets of X such that every pair of elements belongs to at least one subset and no subset has more than 50 members? What is the smallest number if we also require that the union of any two subsets has at most 80 members?

The real numbers $\mathbf{x}_1,\mathbf{x}_2,\ldots ,\mathbf{x}_{1991}$ satisfy $\left|\mathbf{x}_1 - \mathbf{x}_2\right| + \left|\mathbf{x}_2 - \mathbf{x}_3\right| + \ldots +\left|\mathbf{x}_{1990} - \mathbf{x}_{1991}\right| = 1991$ . What is the maximum possible value of $\left|\mathbf{s}_1 - \mathbf{s}_2\right| + \left|\mathbf{s}_2 - \mathbf{s}_3\right| + \ldots +\left|\mathbf{s}_{1990} - \mathbf{s}_{1991}\right|$ , where $\mathbf{s}_n = (\mathbf{x}_1 + \mathbf{x}_2 + \ldots +\mathbf{x}_n) / n$ ?