47th Austrian Mathematical Olympiad

National Competition (Final Round, part 2, first day)

May 25, 2016

1. Let α ∈ Q+ . Determine all functions f : Q+ → Q+ such that

x  f (x)
f +y = + f (y) + αx
y f (y)

holds for all x, y ∈ Q+ .

Here, Q+ denotes the set of positive rational numbers.
(Walther Janous)

2. Let ABC be a triangle. Its incircle meets the sides BC, CA and AB in the points D, E
and F , respectively. Let P denote the intersection point of ED and the line perpendicular
to EF and passing through F , and similarly let Q denote the intersection point of EF
and the line perpendicular to ED and passing through D.
Prove that B is the mid-point of the segment P Q.
(Karl Czakler)

3. Consider arrangements of the numbers 1 through 64 on the squares of an 8 × 8 chess

board, where each square contains exactly one number and each number appears exactly
once.
A number in such an arrangement is called super-plus-good, if it is the largest number in
its row and at the same time the smallest number in its column.
Prove or disprove each of the following statements:

(a) Each such arrangement contains at least one super-plus-good number.

(b) Each such arrangement contains at most one super-plus-good number.

(Gerhard J. Woeginger)

Working time: 4 12 hours.

Each problem is worth 8 points.
 47th Austrian Mathematical Olympiad
National Competition (Final Round, part 2, second day)
May 26, 2016

4. Let a, b, c ≥ −1 be real numbers with a3 + b3 + c3 = 1. Prove that

a + b + c + a2 + b2 + c2 ≤ 4.

When does equality hold?

(Karl Czakler)

5. Consider a board consisting of n × n unit squares where n ≥ 2. Two cells are called
neighbors if they share a horizontal or vertical border. In the beginning, all cells together
contain k tokens. Each cell may contain one or several tokens or none.
In each turn, choose one of the cells that contains at least one token for each of its
neighbors and move one of those to each of its neighbors. The game ends if no such cell
exists.

(a) Find the minimal k such that the game does not end for any starting configuration
and choice of cells during the game.
(b) Find the maximal k such that the game ends for any starting configuration and
choice of cells during the game.

(Theresia Eisenkölbl)

6. Let a, b, c be integers such that

ab ac bc
+ +
c b a
is an integer.
Prove that each of the numbers
ab ac bc
, and
c b a
is an integer.
(Gerhard J. Woeginger)

Working time: 4 21 hours.

Each problem is worth 8 points.