BALTIC-WAY 1997

Determine all functions $f$ from the real numbers to the real numbers, different from the zero function, such that $f(x) f(y)=f(x-y)$ for all real numbers $x$ and $y$.

Given a sequence $a_{1}, a_{2}, a_{3}, \ldots$ of positive integers in which every positive integer occurs exactly once. Prove that there exist integers $\ell$ and $m$, $1<\ell<m$, such that $a_{1}+a_{m}=2 a_{\ell}$.

Let $x_{1}=1$ and $x_{n+1}=x_{n}+\left\lfloor\frac{x_{n}}{n}\right\rfloor+2$ for $n=1,2,3, \ldots$, where $\lfloor x\rfloor$ denotes the largest integer not greater than $x$. Determine $x_{1997}$.

Prove that the arithmetic mean $a$ of $x_{1}, \ldots, x_{n}$ satisfies

$$\left(x_{1}-a\right)^{2}+\cdots+\left(x_{n}-a\right)^{2} \leqslant \frac{1}{2}\left(\left|x_{1}-a\right|+\cdots+\left|x_{n}-a\right|\right)^{2} .$$

In a sequence $u_{0}, u_{1}, \ldots$ of positive integers, $u_{0}$ is arbitrary, and for any non-negative integer $n$,

$$u_{n+1}= \begin{cases}\frac{1}{2} u_{n} & \text { for even } u_{n} \\ a+u_{n} & \text { for odd } u_{n}\end{cases}$$

where $a$ is a fixed odd positive integer. Prove that the sequence is periodic from a certain step.

Find all triples $(a, b, c)$ of non-negative integers satisfying $a \geqslant b \geqslant c$ and $1 \cdot a^{3}+9 \cdot b^{2}+9 \cdot c+7=1997$.

Let $P$ and $Q$ be polynomials with integer coefficients. Suppose that the integers $a$ and $a+1997$ are roots of $P$, and that $Q(1998)=2000$. Prove that the equation $Q(P(x))=1$ has no integer solutions.

If we add 1996 and 1997, we first add the unit digits 6 and 7. Obtaining 13, we write down 3 and "carry" 1 to the next column. Thus we make a carry. Continuing, we see that we are to make three carries in total:

$$\begin{array}{r} 111 \\ 1996 \\ +1997 \\ \hline 3993 \end{array}$$

Does there exist a positive integer $k$ such that adding $1996 \cdot k$ to $1997 \cdot k$ no carry arises during the whole calculation?

The worlds in the Worlds' Sphere are numbered $1,2,3, \ldots$ and connected so that for any integer $n \geqslant 1$, Gandalf the Wizard can move in both directions between any worlds with numbers $n, 2 n$ and $3 n+1$. Starting his travel from an arbitrary world, can Gandalf reach every other world?

Prove that in every sequence of 79 consecutive positive integers written in the decimal system, there is a positive integer whose sum of digits is divisible by 13 .

On two parallel lines, the distinct points $A_{1}, A_{2}, A_{3}, \ldots$ respectively $B_{1}$, $B_{2}, B_{3}, \ldots$ are marked in such a way that $\left|A_{i} A_{i+1}\right|=1$ and $\left|B_{i} B_{i+1}\right|=2$ for $i=1,2, \ldots$ (see Figure). Provided that $\angle A_{1} A_{2} B_{1}=\alpha$, find the infinite sum $\angle A_{1} B_{1} A_{2}+\angle A_{2} B_{2} A_{3}+\angle A_{3} B_{3} A_{4}+\ldots$

Two circles $\mathcal{C}_{1}$ and $\mathcal{C}_{2}$ intersect in $P$ and $Q$. A line through $P$ intersects $\mathcal{C}_{1}$ and $\mathcal{C}_{2}$ again in $A$ and $B$, respectively, and $X$ is the midpoint of $A B$. The line through $Q$ and $X$ intersects $\mathcal{C}_{1}$ and $\mathcal{C}_{2}$ again in $Y$ and $Z$, respectively. Prove that $X$ is the midpoint of $Y Z$.

Five distinct points $A, B, C, D$ and $E$ lie on a line with

$$|A B|=|B C|=|C D|=|D E| \text {. }$$

The point $F$ lies outside the line. Let $G$ be the circumcentre of triangle $A D F$ and $H$ be the circumcentre of triangle $B E F$. Show that lines $G H$ and $F C$ are perpendicular.

In the triangle $A B C,|A C|^{2}$ is the arithmetic mean of $|B C|^{2}$ and $|A B|^{2}$. Show that $\cot ^{2} B \geqslant \cot A \cot C$.

In the acute triangle $A B C$, the bisectors of $\angle A, \angle B$ and $\angle C$ intersect the circumcircle again in $A_{1}, B_{1}$ and $C_{1}$, respectively. Let $M$ be the point of intersection of $A B$ and $B_{1} C_{1}$, and let $N$ be the point of intersection of $B C$ and $A_{1} B_{1}$. Prove that $M N$ passes through the incentre of triangle $A B C$.

On a $5 \times 5$ chessboard, two players play the following game. The first player places a knight on some square. Then the players alternately move the knight according to the rules of chess, starting with the second player. It is not allowed to move the knight to a square that has been visited previously. The player who cannot move loses. Which of the two players has a winning strategy?

A rectangle can be divided into $n$ equal squares. The same rectangle can also be divided into $n+76$ equal squares. Find all possible values of $n$.

a) Prove the existence of two infinite sets $A$ and $B$, not necessarily disjoint, of non-negative integers such that each non-negative integer $n$ is uniquely representable in the form $n=a+b$ with $a \in A, b \in B$.

b) Prove that for each such pair $(A, B)$, either $A$ or $B$ contains only multiples of some integer $k>1$.

In a forest each of $n$ animals $(n \geqslant 3)$ lives in its own cave, and there is exactly one separate path between any two of these caves. Before the election for King of the Forest some of the animals make an election campaign. Each campaign-making animal visits each of the other caves exactly once, uses only the paths for moving from cave to cave, never turns from one path to another between the caves and returns to its own cave in the end of its campaign. It is also known that no path between two caves is used by more than one campaign-making animal.

a) Prove that for any prime $n$, the maximum possible number of campaign-making animals is $\frac{n-1}{2}$;

b) Find the maximum number of campaign-making animals for $n=9$.

Twelve cards lie in a row. The cards are of three kinds: with both sides white, both sides black, or with a white and a black side. Initially, nine of the twelve cards have a black side up. The cards 1-6 are turned, and subsequently four of the twelve cards have a black side up. Now cards $4-9$ are turned, and six cards have a black side up. Finally, the cards 1-3 and 10-12 are turned, after which five cards have a black side up. How many cards of each kind are there?